Introduction to Algorithms and Data Structures

Häftad, Engelska, 2023

1 279 kr

Beställningsvara. Skickas inom 5-8 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

With INTRODUCTION TO ALGORITHMS AND DATA STRUCTURES, 1st Edition, a student will master basic programming patterns and learn how to use them to solve problems. One of the cornerstones of solving problems is knowing which patterns to apply. This is where algorithms and data structures become fundamental. Familiarity with data structures and algorithms allows a programmer to tackle unthinkable problems, using only a programming language’s basic control flow and loops. The book explores several common ideas -- backtracking, depth-first, breadth-first, recursion, divide and conquer and dynamic programming. Not only will this prepare students with problem-solving skills, it will also equip students with employability through technical interview tips and best practices.

Produktinformation

Utgivningsdatum2023-11-01
Mått215 x 17 x 276 mm
Vikt816 g
FormatHäftad
SpråkEngelska
Antal sidor384
FörlagCengage Learning
ISBN9780357673560

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

COVER PAGETITLE PAGECOPYRIGHT PAGEABOUT THE AUTHORINTRODUCTIONACKNOWLEDGMENTSDEDICATIONCHAPTER 1. RECURSION1.1. Introduction to RecursionCalculating the Power of a Number Using RecursionWhat Is Well-Defined Recursion?Stack Overflow ErrorsAdvantages of Using RecursionTail Recursion1.2. Examples of Recursive MethodsComputing Factorials with RecursionComputing the Fibonacci Sequence1.3. Direct and Indirect RecursionComputing Squares of Numbers with Direct and Indirect Recursion1.4. The Tower of HanoiUsing Recursion to Solve the Tower of Hanoi Problem1.5. Backtracking: Finding all SubsetsWhy Use Backtracking?Backtracking SolutionSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 2. INTRODUCTION TO DATA STRUCTURES2.1. Basic Data Structures and AlgorithmsWhat Is a Data Structure?What Is an Algorithm?2.2. Abstract Data Types (ADTs)The StackWhy Use ADTs?2.3. ADT Support in Popular Programming LanguagesADTs in PythonADTs in C++ADTs in JavaADTs in Go2.4. Linear and Non-Linear Data StructuresStoring Data in a List versus a GraphExamples of Linear Data StructuresExamples of Non-Linear Data Structures2.5. Static and Dynamic Data StructuresArrays versus ListsWhen to Use a Static Data Structure2.6. Common Operations of Data StructuresTraversing a Data StructureSearching for an ElementModifying a Data StructureSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 3. DESIGNING EFFICIENT ALGORITHMS3.1. Efficient AlgorithmsAnalyzing AlgorithmsComparing Algorithms3.2. Big O NotationComparing Functions for Big NumbersUpper Bounds for FunctionsPrinciples for Asymptotic Analysis3.3. Algorithm Time ComplexityBasic Asymptotical AnalysisBest, Worst, and Average CaseComplexity of Search in an Array3.4. Space Complexity of AlgorithmsSpace ComplexitySpace Complexity of Reversing a String3.5. Heuristic AlgorithmsComputationally Expensive ProblemsKnapsack ProblemSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 4. SORTING ALGORITHMS4.1. Introduction to Sorting AlgorithmsFinding the Video with Most LikesWhat Is a Sorting Algorithm?Types of Sorting Algorithms4.2. Bubble SortBubble Sort ExampleBubble Sort DetailsPerformance of Bubble Sort4.3. Selection SortSelection Sort ExampleSelection Sort DetailsPerformance of Selection Sort4.4. Insertion SortInsertion Sort ExampleInsertion Sort DetailsPerformance of Insertion Sort4.5. QuicksortQuicksort ExampleQuicksort DetailsPerformance of Quicksort4.6. Merge SortMerge Sort ExampleMerge Sort DetailsPerformance of Merge SortSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 5. SEARCH ALGORITHMS5.1. Introduction to Search AlgorithmsFinding a Friend’s Phone NumberSorted and Unsorted Searches5.2. Sequential SearchSequential Search Algorithm DetailsTime Complexity of Sequential Search5.3. Binary (Interval) SearchSearching without Checking All ElementsBinary Search AlgorithmTime Complexity of Binary Search5.4. Recursive Binary Search MethodBinary Search Using RecursionSpace Complexity of Binary SearchSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 6. LINKED LISTS, STACKS, AND QUEUES6.1. Abstract Data Types: Linked Lists, Stacks, and QueuesLinked ListsStacksQueues6.2. Common Linked Lists OperationsWhy Use Linked Lists?Singly Linked ListsDoubly Linked ListsCircular Linked Lists6.3. Common Stack ADT MethodsWhy Use Stacks?Main Stack OperationsKeeping Parentheses Balanced with Stacks6.4. Queue ADT MethodsWhy Use Queues?Main Queue OperationsPrinting Elements of a Queue in Reverse Order6.5. Array-Based Stacks and QueuesImplementing Stacks with ArraysImplementing Queues with ArraysSummaryKey TermsReview QuestionsProgramming ProblemsProjectsCHAPTER 7. HASH TABLES7.1. Introduction to Hash TablesWhy Hash Tables?When to Use a Hash TablePerfect Hashing and Collisions7.2. Primary Hash Table Operati