Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More, Mailund Thomas


Варианты приобретения
Цена: 69870.00T
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: 202 шт.  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Mailund Thomas
Название:  Introduction to Computational Thinking: Problem Solving, Algorithms, Data Structures, and More
ISBN: 9781484270769
Издательство: Springer
Классификация:


ISBN-10: 1484270762
Обложка/Формат: Paperback
Страницы: 657
Вес: 1.15 кг.
Дата издания: 31.07.2021
Язык: English
Издание: 1st ed.
Иллюстрации: 78 illustrations, black and white; xiii, 657 p. 78 illus.
Размер: 25.40 x 17.81 x 3.43 cm
Читательская аудитория: Professional & vocational
Подзаголовок: Problem solving, algorithms, data structures, and more
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 1 Introduction 1Models of the world and formalising problems . . 4What is computational thinking? . . . . . . . . . 6Computational thinking in a broader context . . . 12What is to come . . . . . . . . . . . . . . . . . . 152 Introducing Python programming 19Obtaining Python . . . . . . . . . . . . . . . . . 20Running Python . . . . . . . . . . . . . . . . . . 22Expressions in Python . . . . . . . . . . . . . . . 22Logical (or boolean) expressions . . . . . . . . . . 26Variables . . . . . . . . . . . . . . . . . . . . . . 30Working with strings . . . . . . . . . . . . . . . . 32Lists . . . . . . . . . . . . . . . . . . . . . . . . 36Tuples . . . . . . . . . . . . . . . . . . . . . . . 41iiiSets and dictionaries . . . . . . . . . . . . . . . . 42Input and output . . . . . . . . . . . . . . . . . . 44Conditional statements (if statements) . . . . . . 47Loops (for and while) . . . . . . . . . . . . . . . 50Using modules . . . . . . . . . . . . . . . . . . . 543 Introduction to algorithms 57Designing algorithms . . . . . . . . . . . . . . . 62Exercises for sequential algorithms . . . . . . . . 81Exercises on lists . . . . . . . . . . . . . . . . . . 874 Algorithmic eciency 95The RAM model of a computer and its primitiveoperations . . . . . . . . . . . . . . . . . . 97Types of eciency . . . . . . . . . . . . . . . . . 107Asymptotic running time and big-Oh notation . . 116Empirically validating an algorithms running time 1355 Searching and sorting 141Searching . . . . . . . . . . . . . . . . . . . . . . 142Sorting . . . . . . . . . . . . . . . . . . . . . . . 147Generalising searching and sorting . . . . . . . . 182How computers represent numbers . . . . . . . . 1866 Functions 197Parameters and local and global variables . . . . . 203Side eects . . . . . . . . . . . . . . . . . . . . . 210Returning from a function . . . . . . . . . . . . . 215Higher order functions . . . . . . . . . . . . . . . 221Functions vs function instances . . . . . . . . . . 227Default parameters and keyword arguments . . . 230Generalising parameters . . . . . . . . . . . . . . 234Exceptions . . . . . . . . . . . . . . . . . . . . . 239Writing your own Python modules . . . . . . . . 2517 Inner functions 253A comparison function for a search algorithm . . 256Counter function . . . . . . . . . . . . . . . . . . 261Apply . . . . . . . . . . . . . . . . . . . . . . . . 265Currying functions . . . . . . . . . . . . . . . . . 269Function composition . . . . . . . . . . . . . . . 274Thunks and lazy evaluation . . . . . . . . . . . . 276Decorators . . . . . . . . . . . . . . . . . . . . . 281Eciency . . . . . . . . . . . . . . . . . . . . . . 2888 Recursion 291Denitions of recursion . . . . . . . . . . . . . . 291Recursive functions . . . . . . . . . . . . . . . . 293Recursion stacks . . . . . . . . . . . . . . . . . . 297Recursion and iteration . . . . . . . . . . . . . . 307Tail-calls . . . . . . . . . . . . . . . . . . . . . . 316Continuations . . . . . . . . . . . . . . . . . . . 324Continuations, thunks and trampolines . . . . . . 3359 Divide and conquer and dynamic programming 343Divide and conquer running times . . . . . . . . 355Dynamic programming . . . . . . . . . . . . . . 371Representing oating point numbers . . . . . . . 39210 Hidden Markov models 399Probabili

Network Science

Автор: Barab?si
Название: Network Science
ISBN: 1107076269 ISBN-13(EAN): 9781107076266
Издательство: Cambridge Academ
Рейтинг:
Цена: 51750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of disciplines from physics to the social sciences, is the only book needed for an introduction to network science. In modular format, with clear delineation between undergraduate and graduate material, its unique design is supported by extensive online resources.

Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide

Автор: Jain Hemant
Название: Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide
ISBN: 1726789985 ISBN-13(EAN): 9781726789981
Издательство: Неизвестно
Цена: 34490.00 T
Наличие на складе: Невозможна поставка.
Описание: "Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In these books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP.


GitHub Repositories for these books.
https: //github.com/Hemant-Jain-Author

Book's Composition
This book introduces you to the world of data structures and algorithms. Data structures defines the way in which data is arranged in memory for fast and efficient access while algorithms are a set of instruction to solve problems by manipulating these data structures.

Designing an efficient algorithm is a very important skill that all software companies, e.g. Microsoft, Google, Facebook etc. pursues. Most of the interviews for these companies are focused on knowledge of data-structures and algorithms. They look for how candidates use concepts of data structures and algorithms to solve complex problems efficiently. Apart from knowing, a programming language you also need to have good command of these key computer fundamentals to not only qualify the interview but also excel in you jobs as a software engineer.

This book assumes that you are a C# language developer. You are not an expert in C# language, but you are well familiar with concepts of classes, functions, arrays, pointers and recursion. At the start of this book, we will be looking into Complexity Analysis followed by the various data structures and their algorithms. We will be looking into a Linked-List, Stack, Queue, Trees, Heap, Hash-Table and Graphs. We will also be looking into Sorting, Searching techniques.

In last few chapters, we will be looking into various algorithmic techniques. Such as, Brute-Force algorithms, Greedy algorithms, Divide and Conquer algorithms, Dynamic Programming, Reduction and Backtracking. .


Table of Contents
Chapter 0: How to use this book.
Chapter 1: Algorithms Analysis
Chapter 2: Approach to solve algorithm design problems
Chapter 3: Abstract Data Type & C# Collections
Chapter 4: Searching
Chapter 5: Sorting
Chapter 6: Linked List
Chapter 7: Stack
Chapter 8: Queue
Chapter 9: Tree
Chapter 10: Priority Queue
Chapter 11: Hash-Table
Chapter 12: Graphs
Chapter 13: String Algorithms
Chapter 14: Algorithm Design Techniques
Chapter 15: Brute Force Algorithm
Chapter 16: Greedy Algorithm
Chapter 17: Divide & Conquer
Chapter 18: Dynamic Programming
Chapter 19: Backtracking
Chapter 20: Complexity Theory

A Physicist`s Introduction to Algebraic Structures: Vector Spaces, Groups, Topological Spaces and More

Автор: Palash B. Pal
Название: A Physicist`s Introduction to Algebraic Structures: Vector Spaces, Groups, Topological Spaces and More
ISBN: 1108492207 ISBN-13(EAN): 9781108492201
Издательство: Cambridge Academ
Рейтинг:
Цена: 77090.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Catering to the needs of graduate students and researchers in the field of mathematical physics and theoretical physics, this comprehensive and valuable text discusses the essential concepts of algebraic structures such as metric space, group, modular numbers, algebraic integers, field, vector space, Boolean algebra and measure angle.

Автор: Palash B. Pal
Название: A Physicist`s Introduction to Algebraic Structures: Vector Spaces, Groups, Topological Spaces and More
ISBN: 1108729118 ISBN-13(EAN): 9781108729116
Издательство: Cambridge Academ
Рейтинг:
Цена: 73910.00 T
Наличие на складе: Поставка под заказ.
Описание: An algebraic structure consists of a set of elements, with some rule of combining them, or some special property of selected subsets of the entire set. Many algebraic structures, such as vector space and group, come to everyday use of a modern physicist. Catering to the needs of graduate students and researchers in the field of mathematical physics and theoretical physics, this comprehensive and valuable text discusses the essential concepts of algebraic structures such as metric space, group, modular numbers, algebraic integers, field, vector space, Boolean algebra, measure space and Lebesgue integral. Important topics including finite and infinite dimensional vector spaces, finite groups and their representations, unitary groups and their representations and representations of the Lorentz group, homotopy and homology of topological spaces are covered extensively. Rich pedagogy includes various problems interspersed throughout the book for better understanding of concepts.

Problem Solving in Data Structures & Algorithms Using C++: Programming Interview Guide

Автор: Jain Hemant
Название: Problem Solving in Data Structures & Algorithms Using C++: Programming Interview Guide
ISBN: 1542396476 ISBN-13(EAN): 9781542396479
Издательство: Неизвестно
Цена: 22990.00 T
Наличие на складе: Невозможна поставка.

Problem Solving with Algorithms and Data Structures using Python

Автор: Thota Mahesh Kumar, Pille Kamakshi
Название: Problem Solving with Algorithms and Data Structures using Python
ISBN: 6200115567 ISBN-13(EAN): 9786200115560
Издательство: Неизвестно
Рейтинг:
Цена: 97330.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Problem Solving in Data Structures & Algorithms Using Java

Автор: Jain Hemant
Название: Problem Solving in Data Structures & Algorithms Using Java
ISBN: 1723982105 ISBN-13(EAN): 9781723982101
Издательство: Неизвестно
Цена: 34490.00 T
Наличие на складе: Невозможна поставка.
Описание: "Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In these books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP.


GitHub Repositories for these books.
https: //github.com/Hemant-Jain-Author

Book's Composition
This book introduces you to the world of data structures and algorithms. Data structures defines the way in which data is arranged in memory for fast and efficient access while algorithms are a set of instruction to solve problems by manipulating these data structures.

Designing an efficient algorithm is a very important skill that all software companies, e.g. Microsoft, Google, Facebook etc. pursues. Most of the interviews for these companies are focused on knowledge of data-structures and algorithms. They look for how candidates use concepts of data structures and algorithms to solve complex problems efficiently. Apart from knowing, a programming language you also need to have good command of these key computer fundamentals to not only qualify the interview but also excel in you jobs as a software engineer.

This book assumes that you are a Java language developer. You are not an expert in Java language, but you are well familiar with concepts of classes, functions, arrays, pointers and recursion. At the start of this book, we will be looking into Complexity Analysis followed by the various data structures and their algorithms. We will be looking into a Linked-List, Stack, Queue, Trees, Heap, Hash-Table and Graphs. We will also be looking into Sorting, Searching techniques.

In last few chapters, we will be looking into various algorithmic techniques. Such as, Brute-Force algorithms, Greedy algorithms, Divide and Conquer algorithms, Dynamic Programming, Reduction and Backtracking. .


Table of Contents
Chapter 0: How to use this book.
Chapter 1: Algorithms Analysis
Chapter 2: Approach to solve algorithm design problems
Chapter 3: Abstract Data Type & JAVA Collections
Chapter 4: Searching
Chapter 5: Sorting
Chapter 6: Linked List
Chapter 7: Stack
Chapter 8: Queue
Chapter 9: Tree
Chapter 10: Priority Queue
Chapter 11: Hash-Table
Chapter 12: Graphs
Chapter 13: String Algorithms
Chapter 14: Algorithm Design Techniques
Chapter 15: Brute Force Algorithm
Chapter 16: Greedy Algorithm
Chapter 17: Divide & Conquer
Chapter 18: Dynamic Programming
Chapter 19: Backtracking
Chapter 20: Complexity Theory

Computational Complexity of Counting and Sampling

Автор: Miklos
Название: Computational Complexity of Counting and Sampling
ISBN: 1138070831 ISBN-13(EAN): 9781138070837
Издательство: Taylor&Francis
Рейтинг:
Цена: 214370.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.

Knowledge-based expert systems in chemistry

Автор: Judson, Philip
Название: Knowledge-based expert systems in chemistry
ISBN: 1788014715 ISBN-13(EAN): 9781788014717
Издательство: Royal Society of Chemistry
Рейтинг:
Цена: 209790.00 T
Наличие на складе: Невозможна поставка.
Описание: This new edition has been thoroughly revised and updated to reflect the advances in using knowledge-based expert systems for chemistry.

Machine Learning Algorithms for Problem Solving in Computational Applications: Intelligent Techniques

Автор: Siddhivinayak Kulkarni
Название: Machine Learning Algorithms for Problem Solving in Computational Applications: Intelligent Techniques
ISBN: 1466618337 ISBN-13(EAN): 9781466618336
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 189420.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Addresses the complex realm of machine learning and its applications for solving various real-world problems in a variety of disciplines, such as manufacturing, business, information retrieval, and security. This premier reference source is essential for professors, researchers, and students in artificial intelligence as well as computer science and engineering.

Computational Intelligence for Managing Pandemics

Автор: Aditya Khamparia, Bharat Bhushan, Prajoy Podder, Rubaiyat Hossain Mondal, Sachin Kumar, Victor Hugo C. de Albuquerque
Название: Computational Intelligence for Managing Pandemics
ISBN: 311071227X ISBN-13(EAN): 9783110712278
Издательство: Walter de Gruyter
Рейтинг:
Цена: 159860.00 T
Наличие на складе: Нет в наличии.
Описание: THE SERIES: INTELLIGENT BIOMEDICAL DATA ANALYSIS
By focusing on the methods and tools for intelligent data analysis, this series aims to narrow the increasing gap between data gathering and data comprehension. Emphasis is also given to the problems resulting from automated data collection in modern hospitals, such as analysis of computer-based patient records, data warehousing tools, intelligent alarming, effective and efficient monitoring. In medicine, overcoming this gap is crucial since medical decision making needs to be supported by arguments based on existing medical knowledge as well as information, regularities and trends extracted from big data sets.

A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills

Автор: Wengrow Jay
Название: A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills
ISBN: 1680502441 ISBN-13(EAN): 9781680502442
Издательство: Wiley
Рейтинг:
Цена: 39060.00 T
Наличие на складе: Поставка под заказ.
Описание: If you last saw algorithms in a university course or at a job interview, you`re missing out on what they can do for your code. Learn different sorting and searching techniques, and when to use each.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия