Discrete Computational Structures, CSE 2353, Fall 2009Homework # 3, 100 Points, Due 11/05/091. Functions, Chapter 5, page 330 of textbooka)Exercise # 5 and # 12b)Exercise # 262. Consider inserting the keys 11, 22, 31, 6, 19, 28, 17, 38, 49 into a hash table of length m = 11using chaining with linked‐lists with the auxiliary hash function h(k) = k mod m.3. An Airlines has following flights between these cities:•From Dallas to San Francisco•From Philadelphia to San Francisco•From Dallas to Philadelphia•From Miami to Philadelphia•From Dallas to MiamiCreate a relation directed graph for the flights among these cities. Represent this relation as amatrix and find the transitive closure of this relation. Does transitive closure represent asymmetric relation?4.Find the best big-O notation to describe the complexity of following algorithms: a)A binary search of n elements b)A linear search to find the smallest number in a list of n numbers c)An algorithm that lists all ways to put the numbers 1,2,3,…,n in a row.
This is the end of the preview.
access the rest of the document.
Big O notation, Analysis of algorithms, Computational complexity theory, print statements