Probability & Expectation
Lecture 3- supplement
1
About this lecture
What is Probability?
What is an Event?
What is a Random Variable?
What is Expectation or Average Value
of a Random Variable?
Usef
CSC 7300
Algorithms Design and
Analysis
Heaps
1
Heaps
Given a set S of data with ordered
keys
Support two main operations
Insert
Extract-min
Decrease-key
2
Binary Heap
A binary heap is a binary t
CSC 7300
Dynamic Programming
1
Dynamic Programming
Greedy algorithms, work on sequential
choice and recursively solve smaller
problems
For some problems, this sequential choice
may not directly work
CSC 7300
NP-Completeness
1
About this Lecture
What is NP ?
How to check if a problem is in NP ?
The problem is alternatively referred as
Language, and each problem instance as a
particular string b
Single-Source Shortest Path
Let G = (V,E) be a weighted graph
the edges in G have weights
can be directed/undirected
can be connected/disconnected
Let s be a special vertex, called source
Target:
CSC 7300
Greedy Algorithms
1
About this lecture
Introduce Greedy Algorithm
Look at some problems solvable by
Greedy Algorithm
2
Coin Changing
Suppose that in a certain country, the
coin dominations
CSC7300
Algorithms Design and
Analysis
Lecture 3: Lower Bounds, Sorting
in Linear Time, Order Statistics
1
Lower Bounds
Lower bound of any comparison
sorting algorithm
applies to insertion sort, sel
CSC 7300 : Lecture 7
Hashing, Pattern Matching
Hashing Problem
Let U = cfw_ 1, 2, , u be a universe
S = n distinct keys chosen from
U
The Hashing Problem :
To store S such that the following
operatio
CSC 7300
Algorithm Design and Anal
ysis
Lecture 2
1
This lecture .
Growth functions
Recurrences
Quicksort
2
Merge Sort
(Recap)
The following is a C-style pseudo-code for Merge So
rt.
The subroutine
CSC 7300
Algorithms Design and Analysis
Week 1
Overview + Growth functions
1
Overview
General Information
Scope
Textbook
Assessment
2
General Information
Web page:
http:/csc.lsu.edu/~rahul/7300
Inst
CSC 7300
Algorithms Design and An
alysis
Lecture 4: Divide and Conquer,
Amortization, Binary Search Trees
1
Divide and Conquer
Review: Median / Selection
Inversion Pairs
Closest Pair
Polynomial Multip
CSC 7300
HW 1
Due Oct 5 by end of day
1.
Give an in-place QuickSort algorithm. Your algorithm should return the
sorted array in the memory space of the input array and use only O(1) extra
memory space