Buy dacode.eu ?

Products related to Algorithms:


  • Algorithms : Technology, Culture, Politics
    Algorithms : Technology, Culture, Politics

    Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms.It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies. The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also “data doubles”.The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology.The examples include state-of-the-art applications of machine learning, such as self-driving cars, and large language models such as GPT. The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy.With its broad scope it can serve as a high-level introduction that picks up and builds on more than two decades of critical research on algorithms.

    Price: 36.99 £ | Shipping*: 0.00 £
  • Nonlinear Programming : Theory and Algorithms (Set)
    Nonlinear Programming : Theory and Algorithms (Set)

    Presenting recent developments of key topics in nonlinear programming, this text looks specifically at three main areas; convex analysis, optimality conditions and dual computational techniques.

    Price: 152.95 £ | Shipping*: 0.00 £
  • The Constitution of Algorithms : Ground-Truthing, Programming, Formulating 
    The Constitution of Algorithms : Ground-Truthing, Programming, Formulating 


    Price: 57.00 £ | Shipping*: 0.00 £
  • Basics of Programming and Algorithms, Principles and Applications
    Basics of Programming and Algorithms, Principles and Applications

    This textbook offers an introduction to topics in algorithms and programming with python.It is originally intended for mathematical students not sufficiently aware about these computer science fields seeking a deeper understanding.It addresses fundamental questions on how to analyze the performance of an algorithm and equips readers with the skills to implement them using python. The textbook is organized in two parts. Part I introduces Python Programming offering a solid foundation to python essentials.Topics covered include first steps in python programming, programs, functions and recursion, data structures.Part II shifts focus to Algorithms and covers topics such as algorithm performance, recursion, the sorting problem, trees as data structures, etc. This book has its origins from several different courses given in the context of thematic schools to diverse audiences in different countries over the years.These countries include Cambodia, Kenya, and Madagascar.

    Price: 49.99 £ | Shipping*: 0.00 £
  • What programming language is best for programming algorithms?

    The best programming language for programming algorithms depends on the specific requirements and constraints of the problem at hand. However, languages like Python, C++, and Java are commonly used for algorithm development due to their strong support for data structures, efficient memory management, and high performance. Python is often preferred for its simplicity and readability, while C++ and Java are chosen for their speed and ability to handle complex computations. Ultimately, the best language for programming algorithms will depend on the specific needs of the project and the programmer's familiarity with the language.

  • What do algorithms achieve?

    Algorithms achieve the ability to process and analyze large amounts of data quickly and efficiently. They help in making predictions, identifying patterns, and solving complex problems. Algorithms are used in various fields such as finance, healthcare, and technology to optimize processes and improve decision-making. Overall, algorithms play a crucial role in automating tasks, improving productivity, and driving innovation.

  • What do algorithms calculate?

    Algorithms are designed to calculate specific tasks or operations based on a set of instructions. They can be used to perform mathematical calculations, process data, analyze patterns, make decisions, and solve problems. In essence, algorithms are used to automate and streamline various processes by following a predefined sequence of steps to produce a desired outcome.

  • What are the Instagram algorithms?

    The Instagram algorithms are a set of complex calculations used by the platform to determine what content users see on their feed. These algorithms analyze user behavior, such as likes, comments, and shares, to prioritize content from accounts that users engage with the most. The algorithms also take into account the timeliness of posts, the relationship between users, and the type of content being shared. By using these algorithms, Instagram aims to show users the most relevant and engaging content on their feed.

Similar search terms for Algorithms:


  • Programming Quantum Computers : Essential Algorithms and Code Samples
    Programming Quantum Computers : Essential Algorithms and Code Samples

    Quantum computers are poised to kick-start a new computing revolution—and you can join in right away.If you’re in software engineering, computer graphics, data science, or just an intrigued computerphile, this book provides a hands-on programmer’s guide to understanding quantum computing.Rather than labor through math and theory, you’ll work directly with examples that demonstrate this technology’s unique capabilities.Quantum computing specialists Eric Johnston, Nic Harrigan, and Mercedes Gimeno-Segovia show you how to build the skills, tools, and intuition required to write quantum programs at the center of applications.You’ll understand what quantum computers can do and learn how to identify the types of problems they can solve.This book includes three multichapter sections: Programming for a QPU—Explore core concepts for programming quantum processing units, including how to describe and manipulate qubits and how to perform quantum teleportation.QPU Primitives—Learn algorithmic primitives and techniques, including amplitude amplification, the Quantum Fourier Transform, and phase estimation.QPU Applications—Investigate how QPU primitives are used to build existing applications, including quantum search techniques and Shor’s factoring algorithm.

    Price: 63.99 £ | Shipping*: 0.00 £
  • Algorithms
    Algorithms

    An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently.Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning.Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader.Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum. After discussing what an algorithm does and how its effectiveness can be measured, Louridas covers three of the most fundamental applications areas: graphs, which describe networks, from eighteenth-century problems to today's social networks; searching, and how to find the fastest way to search; and sorting, and the importance of choosing the best algorithm for particular tasks.He then presents larger-scale applications: PageRank, Google's founding algorithm; and neural networks and deep learning.Finally, Louridas describes how all algorithms are nothing more than simple moves with pen and paper, and how from such a humble foundation rise all their spectacular achievements.

    Price: 15.99 £ | Shipping*: 3.99 £
  • Algorithms
    Algorithms

    Use your big monkey brain to do things that even your teachers can't do.With these books, you will talk to computers, create games, draw pictures and find information.Come on, code monkeys - let's write some code!

    Price: 8.99 £ | Shipping*: 3.99 £
  • Algorithms
    Algorithms

    Use your big monkey brain to do things that even your teachers can't do.With these books, you will talk to computers, create games, draw pictures and find information.Come on, code monkeys - let's write some code!

    Price: 12.99 £ | Shipping*: 3.99 £
  • Which sorting algorithms are there?

    There are several common sorting algorithms, including bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort. Each algorithm has its own advantages and disadvantages in terms of time complexity, space complexity, and stability. The choice of sorting algorithm depends on the specific requirements of the problem at hand.

  • Should one learn without algorithms?

    Learning without algorithms is certainly possible, as there are many different ways to acquire knowledge and skills. However, algorithms can be valuable tools for organizing and processing information, so learning about them can be beneficial. Understanding algorithms can help individuals solve complex problems, improve decision-making processes, and enhance their overall problem-solving abilities. Therefore, while it is not necessary to learn algorithms, doing so can certainly be advantageous in many fields.

  • What are simple algorithms in Java?

    Simple algorithms in Java are step-by-step procedures for solving a specific problem or performing a specific task. These algorithms are typically written in Java programming language and are designed to be easy to understand and implement. Examples of simple algorithms in Java include sorting algorithms like bubble sort or insertion sort, searching algorithms like linear search or binary search, and mathematical algorithms like finding the factorial of a number or calculating the Fibonacci sequence. These algorithms are fundamental building blocks in computer science and are essential for solving a wide range of problems in software development.

  • How do logarithmic sorting algorithms work?

    Logarithmic sorting algorithms work by dividing the input data into smaller subgroups and recursively sorting these subgroups. One common example is the merge sort algorithm, which divides the input list into two halves, sorts each half separately, and then merges them back together in sorted order. By repeatedly dividing the data and merging the sorted subgroups, logarithmic sorting algorithms achieve a time complexity of O(n log n), making them efficient for large datasets.

* All prices are inclusive of VAT and, if applicable, plus shipping costs. The offer information is based on the details provided by the respective shop and is updated through automated processes. Real-time updates do not occur, so deviations can occur in individual cases.