Data Structures & Algorithms
Data Structures & Algorithms COSC 6320
Popular in Course
Popular in Chemistry
This 3 page Class Notes was uploaded by Lowell Harris on Saturday September 19, 2015. The Class Notes belongs to COSC 6320 at University of Houston taught by Staff in Fall. Since its upload, it has received 49 views. For similar materials see /class/208187/cosc-6320-university-of-houston in Chemistry at University of Houston.
Reviews for Data Structures & Algorithms
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/19/15
6320Outline COSC 6320 Course Outline 1 Introduction N 6 7 0 Introduction and Motivation Lower Bound Example Asymptotic Notations Mathematical Induction 0 Mathematical Models Algorithm Analysis Techniques 0 Formulation the Equations 0 Solving the equations 0 Homogeneous Linear Recurrence with Constant Coefficients o Nonhomogeneous Equations 0 Transformations Basic Abstract Data Types 0 Linear Lists 0 Stacks o Queues o Mappings o Stack and Recursive Procedures Trees Structures 0 Basic Terminology o ADT Tree 0 Implementations o Binary Trees Basic Operations on Sets 0 Introduction An ADT with Union Intersection and Difference Bit Vector Implementations Linked List Implementation Dictionary Simple Dictionary Implementations Hash Table Data Structures Efficiency of Hashing Priority Queues 0 Complex Set Structures Dynamic Hashing 0 Introduction 0 Dynamic Hashing o Extensible Hashing 0 Linear Hashing Advanced Set Representation Methods 0 Binary Search Trees 6320Outline Time Analysis Optimum Binary Search Trees An Approximation Algorithm Tries Balanced Trees 0 Sets with Merge and Find 8 ADT with Merge amp Split 0 BTrees o BTree Variants o BTrees in a Multiuser Environment 0 Fringe Analysis 9 Directed Graphs 0 Basic De nitions Representations for Directed Graphs The SingleSource Shortest Path Problem AllPairs Shortest Paths Problem DepthFirst Spanning Forest Direct Acyclic Graphs 0 Strong Components 10 Undirected Graphs 0 De nitions 0 MinimumCut Spanning Trees 0 Traversal o Articulation Points amp Biconnected Components Graph Matching ll Sorting 0 Internal Sorting Model Simple Sorting Algorithms Quicksort Heapsort Bin Sort A Lower bound for sorting by Comparisons 0 Order Statistics 12 Data Structures amp Algorithms for External Storage 0 A Model 0 External Sorting l3 Algorithm Design Techniques 0 DiVide and Conquer Dynamic Programming Greedy Method Backtracking Algorithm Local Search Approximation 14 Lower Bound Theory 0 De nition 6320Out1ine 0 Decision Tree Method 0 Oracle Method 0 State Space Method 15 P and NP 0 De nitions 16 Other Selected Topics
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'