• 0 5391 6310 , 0 5391 6320
  • acquisition_library@mfu.ac.th
  • BOOK
  • E-BOOK
  • RECOMMEND OTHER BOOKS
  • SATISFACTION ASSESSMENT FORM
        
  • Log in
  • HOME
  • CATEGORY
    • Agro-Industry
    • Anti Aging and Regenerative Medicine
    • Applied Digital Technology
    • Cosmetic Science
    • Dentistry
    • General Books
    • Health Science
    • Integrative Medicine
    • Law
    • Liberal Arts
    • Management
    • Medicine
    • Nursing
    • Science
    • Sinology
    • Social Innovations
  • BOOKFAIR WEBSITE
  • MANUAL

Category

Agro-Industry

Anti Aging and Regenerative Medicine

Applied Digital Technology

Cosmetic Science

Dentistry

Health Science

Integrative Medicine

Law

Liberal Arts

Management

Medicine

Nursing

Science

Sinology

Social Innovations

General Books

Book

Problems on Algorithms : A Comprehensive Exercise Book for Students in Software Engineerin

ISBN : 9783031170423

Author : Habib Izadkhah

Publisher : Springer

Year : 2022

Language : English

Type : Book

Description : With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algorithms. To make this book suitable for self-instruction, about one-third of the algorithms are supported by solutions, and some others are supported by hints and comments. This book is intended for students wishing to deepen their knowledge of algorithm design in an undergraduate or beginning graduate class on algorithms, for those teaching courses in this area, for use by practicing programmers who wish to hone and expand their skills, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. About all, it is a good source for exam problems for those who teach algorithms and data structure. The format of each chapter is just a little bit of instruction followed by lots of problems. This book is intended to augment the problem sets found in any standard algorithms textbook. This book • begins with four chapters on background material that most algorithms instructors would like their students to have mastered before setting foot in an algorithms class. The introductory chapters include mathematical induction, complexity notations, recurrence relations, and basic algorithm analysis methods. • provides many problems on basic and advanced data structures including basic data structures (arrays, stack, queue, and linked list), hash, tree, search, and sorting algorithms. • provides many problems on algorithm design techniques: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, and backtracking algorithms. • is rounded out with a chapter on NP-completeness.

Please register to recommend this book to the library.

RECOMMENDED BOOKS

An Invitation to Social Construction

Kenneth Gergen

  • Detail

Food Packaging Materials

Caio Otoni

  • Detail

Teaching Social Equity in Public Administration

Sean A. McC

  • Detail

Molecular Mechanisms of Action of Functional Foods and Nutraceuticals for Chronic Diseases

Shima Abdollahi

  • Detail

Sport Tourism, Island Territories and Sustainable Development

Derek Van Rheenen

  • Detail

Clinical Cases in Periodontics

Nadeem Karimbux

  • Detail

Teaching and Learning in the Digital Era Issues and Studies

Jun Xu

  • Detail

Board-Shareholder Dialogue

Enriques

  • Detail

Learning Reources and Education Media Centre - Mae Fah Luang University