Search results for "Frequently Asked Coding Interview - Algorithms"
Items we need to order for you

R 1,798.00

Combinatorial Algorithms
This book constitutes the refereed proceedings of the 36th International Workshop on Combinatorial Algorithms, IWOCA 2025, held in Bozeman, MT, USA, during July 21-24, 2025. The 32 full papers and two abstracts of invited talks included in this book were carefully reviewed and selected from 71 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business.
R 6,591.78



R 497.00

R 1,602.72



Approximation and Online Algorithms
The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.
R 2,015.00

R 1,805.13





Efficient Algorithms for Listing Combinatorial Structures
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.
R 5,399.13

Grid Generation and Adaptive Algorithm
The papers in this volume are based on lectures given at the IMA Workshop on Grid Generation and Adaptive Algorithms held during April 28 - May 2, 1997. Grid generation is a common feature of many computational tasks which require the discretization and representation of space and surfaces. The papers in this volume discuss how the geometric complexity of the physical object or the non-uniform nature of the solution variable make it impossible to use a uniform grid. Since an efficient grid requires knowledge of the computed solution, many of the papers in this volume treat how to construct grids that are adaptively computed with the solution. This volume will be of interest to computational scientists and mathematicians working in a broad variety of applications including fluid mechanics, solid mechanics, materials science, chemistry, and physics.Papers treat residual-based error estimation and adaptivity, repartitioning and load balancing for adaptive meshes, data structures and local refinement methods for conservation laws, adaptivity for hp-finite element methods, the resolution of boundary layers in high Reynolds number flow, adaptive methods for elastostatic contact problems, the full domain partition approach to parallel adaptive refinement, the adaptive solution of phase change problems, and quality indicators for triangular meshes.
R 3,021.58


R 606.00



R 814.00


Verilog: Frequently Asked Questions
The Verilog Hardware Description Language was first introduced in 1984. Over the 20 year history of Verilog, every Verilog engineer has developed his own personal “bag of tricks” for coding with Verilog. These tricks enable modeling or verifying designs more easily and more accurately. Developing this bag of tricks is often based on years of trial and error. Through experience, engineers learn that one specific coding style works best in some circumstances, while in another situation, a different coding style is best. As with any high-level language, Verilog often provides engineers several ways to accomplish a specific task. Wouldn’t it be wonderful if an engineer first learning Verilog could start with another engineer’s bag of tricks, without having to go through years of trial and error to decide which style is best for which circumstance? That is where this book becomes an invaluable resource. The book presents dozens of Verilog tricks of the trade on how to best use the Verilog HDL for modeling designs at various level of abstraction, and for writing test benches to verify designs. The book not only shows the correct ways of using Verilog for different situations, it also presents alternate styles, and discusses the pros and cons of these styles.
R 4,110.50


R 916.00

Combinatorial Heuristic Algorithms with FORTRAN
In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Although algorithms have been designed and are notorious among researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6. Graph Partitioning 98 Chapter 7. K-Median Location 106 Chapter 8. K-Center Location 114 List of Subroutines 123 Bibliographic Notes 124 INTRODUCTION Following the elegant theory of NP-comp1eteness, the idea of developing efficient heuristic algorithms has been gaining its popularity and significance.
R 2,015.00

From Algorithms to Hardware Architectures
This book uses digital radios as a challenging design example, generalized to bridge a typical gap between designers who work on algorithms and those who work to implement those algorithms on silicon. The author shows how such a complex system can be moved from high-level characterization to a form that is ready for hardware implementation. Along the way, readers learn a lot about how algorithm designers can benefit from knowing the hardware they target and how hardware designers can benefit from a familiarity with the algorithm. The book shows how a high-level description of an algorithm can be migrated to a fixed-point block diagram with a well-defined cycle accurate architecture and a fully documented controller. This can significantly reduce the length of the hardware design cycle and can improve its outcomes. Ultimately, the book presents an explicit design flow that bridges the gap between algorithm design and hardware design.Provides a guide to baseband radio design for Wi-Fi and cellular systems, from an implementation-focused, perspective;Explains how arithmetic is moved to hardware and what the cost of each operation is in terms of delay, area and power;Enables strategic architectural decisions based on the algorithm, available processing units and design requirements.
R 4,288.87

Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, held in Kharagpur, India, in February 2019.The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions.The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity.
R 2,175.08

R 1,110.03

Ethics of Algorithms
Algorithmic ethics is an attempt to specify moral-philosophical questions arising from the processes of change and transformation brought about by digitisation. As a scientific endeavour, its primary goal is to identify and justify ethical criteria and principles for sustainable value creation through the responsible use of data. The aim of this book is to contribute to the positioning and extensive development potential of an independent algorithmic ethics. The central task is the conceptual description of the problem of transparency and control in the context of digital technologies. This competence or empowerment problem is made accessible to an ethical approach in order to assess it and to highlight design perspectives.
R 4,030.00

R 428.00


Frontiers in Algorithmics
This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017.The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.
R 2,172.12

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
R 2,186.38

R 2,370.20


R 489.00

Introduction to Combinatorial Optimization
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, suchas greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.
R 2,198.00

R 604.00

R 611.00


Theory and Practice of Intelligent Algorithms
In this book, the latest achievements of the computation time analysis theory and practical applications of intelligent algorithms are set out. There are five chapters: (1) new method of intelligent algorithm computation time analysis; (2)Application of intelligent algorithms in computer vision; (3)Application of intelligent algorithms in logistics scheduling; (4)Application of intelligent algorithms in software testing; and (5) application of intelligent algorithm in multi-objective optimization. The content of each chapter is supported by papers published in top journals. The authors introduce the work of each part, which mainly includes a brief introduction (mainly for readers to understand) and academic discussion (rigorous theoretical and experimental support), in a vivid and interesting way through excellent pictures and literary compositions. To help readers learn and make progress together, each part of this book provides relevant literature, code, experimental data, and so on.
R 3,531.00

R 1,985.80

R 779.00

R 548.00

Introduction to Quantum Computing Algorithms
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
R 2,206.35

Applied Nature-Inspired Computing: Algorithms and Case Studies
This book presents a cutting-edge research procedure in the Nature-Inspired Computing (NIC) domain and its connections with computational intelligence areas in real-world engineering applications. It introduces readers to a broad range of algorithms, such as genetic algorithms, particle swarm optimization, the firefly algorithm, flower pollination algorithm, collision-based optimization algorithm, bat algorithm, ant colony optimization, and multi-agent systems. In turn, it provides an overview of meta-heuristic algorithms, comparing the advantages and disadvantages of each. Moreover, the book provides a brief outline of the integration of nature-inspired computing techniques and various computational intelligence paradigms, and highlights nature-inspired computing techniques in a range of applications, including: evolutionary robotics, sports training planning, assessment of water distribution systems, flood simulation and forecasting, traffic control, gene expression analysis, antenna array design, and scheduling/dynamic resource management.
R 4,030.00

















































