Homework 12
Total points = 9 but I may add one or two problems
Problem 1. [1 pt] Consider an undirected graph G = (V,E). For each node v in V, the degree of v is the
number of links that are incident to v. Let deg(v) denote the degree of node v. The follo

Outline
What is NP Complete
What is NP Complete and why is it
important?
EE 367 University of Hawaii
1
Galen Sasaki
What is a difficult problem?
EE 367 University of Hawaii
2
Problems that are not polynomial time (perhaps
exponential time or higher)
Intra

r s :3 ‘
£5 357 Spring 2015 -Correction w
Homework 10 Total Points = 13
Problem 1 (1 pt). Draw a Huffman tree for the following symbols and their probabilities.
Symbol Probability
_
_ Problem 2 (1 pt). Consider the following Huffman tree. The data are ASC

ER 367 Spring 2015 This is closed book. Solution
Quiz 2: Points = 2
This quiz uses the following struct
struct node {
int data; / 4 bytes
struct node * next; / 4 bytes
};
Problem 1 (1 pt) Consider the following program:
struct node * head;
struct node * p

r s :3 ‘
£5 357 Spring 2015 -Correction w
Homework 10 Total Points = 13
Problem 1 (1 pt). Draw a Huffman tree for the following symbols and their probabilities.
Symbol Probability
_
_ Problem 2 (1 pt). Consider the following Huffman tree. The data are ASC

EE 367 Spring 2015 Midterm Exam Solution
instructions: You have 50 minutes. You may use two sheets of notes (8.5"x11", back and front). Put all
answers on the exam. Show your work and read carefully. If something is unclear, write down your
assumptions al

Homework 12
Total points = 9 but 1 may add one or two problems
Problem 1. [1 pt] Consider an undirected graph G = (V,E). For each node v in V, the “degree” ofv is the
number of links that are incident to v. Let deg(v) denote the degree of node v. The foll

EE 367 Spring 2015 Homework 1 Total points = 8 Solution
Problem A H ptl Prove by direct proof: If a is an integer, divisible by 4, then a is the difference
of two perfect squares.
Proof. Suppose a is an integer, divisible by 4. Then there is an integer b

EE 36'! Homework 11 Solution
Total points = 8
Problem 1 (1 pt). Consider the following directed graph, or digraph. Give its adjacency matrix and adjacency
list. (You can find examples ofadjacency matrices and lists in Section 16.1 of Chapter 16.)
The ne

EE 367L: Big Data Report
Date: May 6, 2015
Abstract:
The purpose of this report is to research on the topic of big data. Big data is an important
computer topic due to the massive amounts of data that is being collected. With the large
amounts of data bei

EE 367 Spring 2015 Correction
Homework 10 Total Points = 13
Problem 1 (1 pt). Draw a Huffman tree for the following symbols and their probabilities.
Symbol
a
b
c
d
e
f
g
h
Probability
0.1
0.05
0.6
0.1
0.025
0.025
0.05
0.05
Symbol
c
d
a
b
h
g
f
e
Encoding

EE 367 Homework 11
Total points = 8
Problem 1 (1 pt). Consider the following directed graph, or digraph. Give its adjacency matrix and adjacency
list. (You can find examples of adjacency matrices and lists in Section 16.1 of Chapter 16.)
A
B
C
D
E
A
1
0
0

Charles Jarquio
EE 367 Homework 1
1)
Statement: The connector is loose or the machine is unplugged.
DeMorgan: The connector is not loose and the machine is plugged in.
2)
Statement: For all integers a, (a-1)/a is not an integer
Counter-example: a=2
(2-1)/