CSE 5311 Design and Analysis of Algorithms Fall 2008 Quiz 1 Each Question carries 25 points Answer All questions Time: 60 Minutes Name:
NOTE: *One Reference Sheets allowed for this Quiz.
ID:
Printed on only one side of the Sheet (Letter Size); One inch (o
CSE 5311 Design and Analysis of Algorithms FALL 2007 Department of Computer Science The University of Texas at Arlington Exercise Set 2
1) Answer questions 1a to 1c pertaining to the STOOGE_SORT Algorithm given below.
STOOGE_SORT(A,i,j) 1 2 3 4 5 6 7 8 a.
CSE5311 Design and Analysis of Algorithms Exercise Problems 1 08/29/07 General Instructions about Exercise Problems
Problems and solutions will be discussed in Class. Solutions will not be available online. You should attend class or meet with the Instru
Backtracking and Branch and Bound
Module 11 CSE5311 Fall 2008
Backtracking
Using Backtracking
Large instances of difficult combinatorial problems can be solved Worst case complexity of Backtracking can be exponential
Typically, a path is taken to check if
String Matching Algorithms
Topics
Basics of Strings Brute-force String Matcher Rabin-Karp String Matching Algorithm KMP Algorithm
1
In string matching problems, it is required to find the occurrences of a pattern in a text. These problems find application
Computational Geometry
Further Reading
TOPICS Preliminaries Point in a Polygon Polygon Construction Convex Hulls
CSE5311
1
Geometric Algorithms
Geometric Algorithms find applications in such areas as Computer Graphics Computer Aided Design VLSI Design G
Computational Geometry
TOPICS Preliminaries Point in a Polygon Polygon Construction Convex Hulls Further Reading Chapter 35 from Text book
CSE5311
1
Geometric Algorithms
Geometric Algorithms find applications in such areas as Computer Graphics Computer Ai
Exercise Set 2
CSE 5311 Design and Analysis of Algorithms SPRING 2007
1. Solve the following recurrence relation T(n) = T(n-1) + n/2 , T(1) = 1 2. Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is co
CSE5311 Design and Analysis of Algorithms Exercise Problems 3 09/17/07
1.
Let G = (V,E) be an (undirected) graph with costs ce 0 on the edges eE. Assume you are given a minimum-cost spanning tree T in G. Now assume that a new edge is added to G, connectin
CSE5311 Design and Analysis of Algorithms Exercise Problems 3
1.
Let G = (V,E) be an (undirected) graph with costs ce 0 on the edges eE. Assume you are given a minimum-cost spanning tree T in G. Now assume that a new edge is added to G, connecting two nod
NP-Complete Problems
P and NP Polynomial time reductions Satisfiability Problem, Clique Problem, Vertex Cover, and Dominating Set
10/19/2009
CSE 5311 FALL 2009 KUMAR
1
Polynomial Algorithms
Problems encountered so far are polynomial time algorithms The w
ComputationalGeometry
TOPICS Preliminaries Point in a Polygon ClicktoeditMastersubtitlestyle Polygon Construction Convex Hulls
u u u u
Further Reading
CSE5311
11
Geometric Algorithms
Geometric Algorithms find applications in such areas as Computer Graphic
String Matching Algorithms
Topics
Basics of Strings Brute-force String Matcher Rabin-Karp String Matching Algorithm KMP Algorithm
1
In string matching problems, it is required to find the occurrences of a pattern in a text. These problems find application
Flow Networks
Topics
Flow Networks Residual networks Ford-Fulkersons algorithm Ford-Fulkerson's Max-flow Min-cut Algorithm
9/28/2009
CSE 5311 Kumar
1
Flow Networks
A directed graph can be interpreted as a flow network to analyse material flows through net
Greedy Algorithms
TOPICS Greedy Strategy Activity Selection Minimum Spanning Tree Shortest Paths Huffman Codes Fractional Knapsack
9/21/09
CSE 5311 Fall 2007 M Kumar
1
The Greedy Principle
The problem: We are required to find a feasible solution that eit
Matrix Operations
A B
C
D
Replace `add' by `OR' and `Multiply' by `AND'
Paths of length 2 or less
Matrix operations on graphs
A B
C
D
Replace `add' by `OR' and `Multiply' by `AND'
Existence of paths containing exactly two edges
Matrix operations on graphs
CSE5311 Design and Analysis of Algorithms Fall 2009 September 28, 2009 Exercise Set 5
1. Suppose you are managing the construction of billboards on the Stephen Daedalus Memorial Highway, a heavily traveled stretch of road that runs west-east for M miles.
CSE5311 Design and Analysis of Algorithms Exercise Problems 2 09/09/09
1. You are given a list of numbers for which you need to construct a min-heap. (A Min-heap is a binary tree in which every key is less than or equal to the keys in its children.) Write
Module 3 - Graph Algorithms
This week Graph terminology G ht i l Stacks and Queues Breadth-first-search Depth-first-search Connected Components Analysis of BFS and DFS Algorithms
Please see Reference Books
8/30/2009
M KUMAR
CSE5311
1
Course Syllabus
Revi
CSE5311 Module 2
This Class
Heaps and Heapsort? QuickSort Mergesort Other Sorting Algorithms
At the end of the class Binary trees Priority queues and heaps Quicksort
Worstcase Bestcase
Further Reading Reference books on Algorithms
8/30/2009 M KUMAR
Mer
CSE5311
Design and Analysis of Algorithms
8/24/2009
CSE5311 Fall 2009
M Kumar
1
What are algorithms?
An algorithm is a precise and unambiguous specification of a sequence of steps that can be carried out to solve a given problem or to achieve a given con
CSE5311 Design and Analysis of Algorithms Exercise Problems 1 01/18/07
1. Given an array of integers A[1.n], such that, for all i, 1 i < n, we have A[i]-A[i+1] 1. Let A[1] = x and A[n] = y, such that x < y. Design an efficient search algorithm to find j s