Problems on Algorithms (Record no. 174321)

MARC details
000 -LEADER
fixed length control field 04005nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-17043-0
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125115.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221101s2022 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031170430
-- 978-3-031-17043-0
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-031-17043-0
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number TA345-345.5
072 #7 - SUBJECT CATEGORY CODE
Subject category code UN
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM018000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UN
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 620.00285
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Izadkhah, Habib.
Relator term author.
Relator code aut
-- http://id.loc.gov/vocabulary/relators/aut
245 10 - TITLE STATEMENT
Title Problems on Algorithms
Medium [electronic resource] :
Remainder of title A Comprehensive Exercise Book for Students in Software Engineering /
Statement of responsibility, etc by Habib Izadkhah.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2022.
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2022.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 513 p. 95 illus., 4 illus. in color.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Mathematical Induction -- Growth of Functions -- Recurrence Relations -- Algorithm Analysis -- Basic Data Structure -- Hash -- Tree -- Search -- Sorting -- Divide and Conquer -- Dynamic Programming -- Greedy Algorithms -- Graph -- Backtracking Algorithms -- P, NP, NP-Complete, and NP-Hard Problems.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Engineering
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational intelligence.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Machine learning.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Engineering mathematics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Engineering.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational Intelligence.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Machine Learning.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical and Computational Engineering Applications.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783031170423
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783031170447
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783031170454
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-031-17043-0">https://doi.org/10.1007/978-3-031-17043-0</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in