Discrete Computational Structures, CSE 2353, Fall 2009
Homework # 3, 100 Points, Due 11/05/09
1.
[10] Functions, Chapter 5, page 330 of textbook
a)
Exercise # 5 and # 12
b)
Exercise # 26
2.
[10] Consider inserting the keys 11, 22, 31, 6, 19, 28, 17, 38, 49 into a hash table of length m = 11
using chaining with linked
‐
lists with the auxiliary hash function h(k) = k mod m.
3.
[20] 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 Miami
Create a relation directed graph for the flights among these cities. Represent this relation as a
matrix and find the transitive closure of this relation. Does transitive closure represent a
symmetric relation?
4.
[20]
Find the best bigO 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.
Sign up
to
access the rest of the document.
 Spring '09
 BhanuKapoor
 Big O notation, Analysis of algorithms, Computational complexity theory, print statements

Click to edit the document details