Ср, 17 Янв 18, 9:24 PM
Приветствую Вас Гость | Регистрация | Вход


Меню сайта
Форма входа
Категории раздела
Art, Drawing [1]
Cooking [4]
Computers [3]
Electrical Engineering [2]
Encyclopedias [1]
Hobby, DIY [7]
Home Design [1]
Fiction, Non Fiction [0]
For Children [0]
Graphics Programs [5]
Health and Care [1]
Microcontrollers [4]
Microsoft Office [0]
Mobile Devices [2]
Music [0]
Photography [1]
Popular science [3]
Programming [23]
Psychology [0]
Robotics [2]
Security [2]
Self-development [0]
Technics [4]
Travel [1]
Unix and Linux [0]
Web Design [0]
Woodworking [1]
Other [3]

Экстремальный курс гитары для новичка (2010) 

Интернет бутик за 7 дней + VIP (2015) 

Видео-уроки лепки для детей и взрослых.(mp4) 

Межсетевое взаимодействие в сетях на базе TCP-IP (2014) 

Как научиться рисовать. Видеокурс (2014) 

The Fabulous Lounge Quartet - Michael Jackson Cafe (2014) 

David Lanz - Love Songs (2001) 

Thomas Anders - Christmas for You (2012) 

Lisa Stansfield - Seven (2014) 

Brian Crain - A Simple Life (1999) 

Болотов - Здоровье человека в нездоровом мире

Новые джинсы за один вечер. Украшаем, перешиваем, расписываем.

Химические вещества, улучшающие умственные способности.

Аллен Карр - Легкий способ бросить курить.

Кремлевская диета. 250 новых рецептов.


Главная » Статьи » BOOKS » Programming

Algorithms: Design and Analysis

Название: Algorithms: Design and Analysis
Автор: Harsh Bhasin
Издательство: Packt Publishing
Год: 2015
Страниц: 692
Формат: PDF
Размер: 59 Mb
Язык: English

Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms.

The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms.

Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms. The book also has 10 appendixes which include topics like probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis and problems based on writing algorithms. The concepts and algorithms in the book are explained with the help of examples which are solved using one or more methods for better understanding.

The book includes variety of chapter-end pedagogical features such as point-wise summary, glossary, multiple choice questions with answers, review questions, application-based exercises to help readers test their understanding of the learnt concepts.



Скачать | UsersCloud


Еще больше ЗДЕСЬ

Категория: Programming  (07 Янв 18)
Теги: Design, Packt Publishing, algorithms, Computational Biology, Machine Learning, AnAlySis
Всего комментариев: 0

Другие материалы по теме:
Имя *:
Email *:
Код *: