CSE 5211 Homework
Fall 2008 Points: 20 Due: 9/23/08
1. The following is a recurrence formula. Write a Dynamic Programming algorithm for computing a[i,j], 0<cfw_i, j N, where N is a constant. a[i, 0]= -2i, a[0, j]= -2j, a[i, j] = maxcfw_a[i-1,j]-2, a[i, j-
INTRODUCTION Why write algorithms: (1) To get it out of the head, human memory is unreliable! (2) To communicate with the programmer and other algorithm developers. (3) To prove its correctness, to analyze, to improve its efficiency, . ALGORITHM: What is
18-791 Lecture #17 INTRODUCTION TO THE FAST FOURIER TRANSFORM ALGORITHM Richard M. Stern
Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Phone: +1 (412) 268-2535 FAX: +1 (412) 268-3890 [email protected]
CSE 4020/5260
Class Project
Part #3
Fall 2000
Due Date: 12/11/00
The purpose of this part of the project is to execute a collection of queries on the database created in parts #1 and #2.
The specic queries are those specied below, which are from the TPC-H
Debasis Mitra, 2014
NP-COMPLETE PROBLEMS
Polynomial
Computers and Intractability: A Guide to the Theory of NP-Completeness, Michael R. Garey
and David S. Jonson, W.H. Freeman and Company, New York, 1979, ISBN: 0-7167-1045-5.
Before we start: be reminded
GRAPH ALGORITHMS
Definitions (background):
Graph: nodes/vertices, and edges/arcs as pairs of nodes. cfw_V, E
e12=(v1, v2, l12)
The third term l12, if present, could be a label or the weight of an
edge.
Directed graph: edges are ordered pairs of nodes.
Wei
Database Systems
Class Project
Part #2
Target Date: ASAP
The purpose of this part of the project is to load data into the TPC-H database created in part #1. For this
part of the project you will 1) download the 5GB data set from the class website and 2) u
Assignment #1
SSDs vs. Magnetic Disks
Target Date: 5/27/2015
Clearly SSDs (Solid State Drives) are more common these days, but the question remains are SSDs
replacing magnetic disks in large or very large database systems? More specifically, have the data
CSE 5660
Class Homework Assignments
Target Date: Each is due one week from date of assignment.
1.
Find a vendor specification sheet for a disk drive. Read through the specification sheet, highlight any
noteworthy items and bring it to class for discussion
CSE 5211/4081 Algorithm Analysis HomeWork 4 Points: UG: 20/ Grad:20
Due: 11/3/05
.1. Write a recursive algorithm for the following formula. Input: a matrix of integers pij, 1<=i<=n, 1<=j<=n, for problem size n. C(i, j) = 0, for all 1<=i>j<=n. C(i, j) = mi
CSE 5211/4081
Algorithm Analysis HomeWork 3 Due: 9/29/05 Points: 15/25
.1. Write the recurrence equation for time complexity of the following algorithm and solve it using Master Theorem. [5] Algorithm Useless(Global array A, index first, index last) .(1)
Homework 3 Fall 2003 Algorithms Due: November 11, 2003 in class
Points: 50/60
1. Write down a pseudo-code for the divide-and-conquer Integer Multiplication algorithm. [10] function Mul(x,y) n = common bit length of x and y if n = = 1 then return x*y else
CSE 5211 Homework
Fall 2008 Points: 35 Due: 10/2/08
1. The binomial coefficient is defined recursively as follows: C(N, 0) = 1, C(N, N) =1, and for 0<k<N, C(N, k) = C(N-1, k) + C(N-1, k-1). Write a Dynamic Programming (DP) algorithm and analyze its time c
Analysis of Algorithms CSE 5211 Fall 2011 Final Exam Points 60 Intro to Analysis of Algorithms CSE 4081 Fall 2011 Final Exam Pts 60 Time: 110 min Q1. The following is a directed graph G: V= cfw_a, b, c, d, e, f, g, h, i E= cfw_(a, b), (a, d), (b, c), (c,
HW1) [10=10+10] pts 1. Program and compare the complexity of those two algorithms. a) for (i=0; i<n; i+) complexity+; cfw_
b)
for (i=0; i<n; i+) cfw_ for (j=0; j<=i*i; j+) cfw_ for (k=0; k<j; k+) complexity+;
cfw_
You may pick any 4 different values f
Home Work 2
Fall 2003
CSE 4081/ 5211 Due: 10/7/03
Points: 50
1) Prove that X^2 = O(2^X) For c=1, X^2 <= 2^X, for every X>=4. Hence for (c=1, N0=4) the definition of big-O follows. 2) Set up its recurrence equation and find the general solution. procedure
BACKTRACKING (Continued) Note that Backtracking algorithms run in a depth first search fashion. Refer to the call sequence of the bit-string printing algorithm's recursion tree. Sometimes some nodes and their descendants are not explored (pruned) because
CSE 5211
Analysis of Algorithms
Fall 2004
Graduate Class Project (this description may be updated) Due: Tuesday, November 2, 2003 Purpose: (1) Implement the quick sort algorithm, (2) experiment with it to understand the intricacies of the sorting problem
GRAPH ALGORITHMS Definitions (background): Graph: nodes/vertices, and edges/arcs as pairs of nodes. cfw_V, E e12=(v1, v2, l12) The third term l12, if present, could be a label or the weight of an edge. Directed graph: edges are ordered pairs of nodes. Wei
CSE 5211/4081 Fall 2005 Homework 0
Points: 20
Due: 8/30/05
Objective of this Home Work is to assess your background, and your current knowledge toward the target syllabus with some sample questions. It will be graded but not considered for the final cours
CSE 4081/5200 Due: November 9
Fall 2004
Home Work 2
Points 30
1. Set up the recurrence equation for time complexity of the following algorithm and solve it for the usual theta function (asymptotic time-complexity). [10] Algorithm Little (int array A[], in
Database Systems
Class Project
Part #1
Target Date: ASAP
The purpose of the class project is to implement a relational database, load it with data, and execute a
collection of queries. For this project you are to use the DBMS you installed (or obtained ac
Assignment #3
DBMS Indexing
Target Date: 6/26/2015
For this assignment you are required to identify something interesting regarding the indexing techniques
used by the DBMS assigned to you in class. Does the vendor have a unique indexing approach? Have th
CSE 5636 Network Security
CYB 5290 Secure Data Communica=ons and Networks
Basic Cryptography
Dr. Marco Carvalho
Associate Professor
Harris Institute for Assured Information
Florida Institute of Technology
Melbourne, FL
A Simple Secu
CSE 5636 Network Security
CYB 5290 Secure Data Communica=ons and Networks
Network Security Concepts
Dr. Marco Carvalho
Associate Professor
Harris Institute for Assured Information
Florida Institute of Technology
Melbourne, FL
Cyber
CSE 5636 Network Security
CYB 5290 Secure Data Communica=ons and Networks
Review: Computer Networks
Dr. Marco Carvalho
Associate Professor
Harris Institute for Assured Information
Florida Institute of Technology
Melbourne, FL
The OSI
ALGORITHM ANALYSIS
Analysis of Resource consumption by processor
Time
Memory
Number of processors
Power
Proof that the algorithm works correctly
ALGORITHM ANALYSIS
Time is measured with Step Counts in an Algorithm
Why?
Not a constant number, but as a
ALGORITHM TYPES
Greedy, Divide and Conquer, Dynamic Programming,
and Backtracking
Note the general strategy from the examples
The classification is neither exhaustive (there may be
other types), nor mutually exclusive (one may
combine)
PROBLEM 1: DYNAM
ALGORITHM TYPES
Greedy, Divide and Conquer, Dynamic Programming,
Random Algorithms, and Backtracking.
Note the general strategy from the examples.
The classification is neither exhaustive (there may be
more) nor mutually exclusive (one may combine).
W