Minimum Spanning Trees
CIS 606
Spring 2010
Problem
A town has a set of houses and a set of
roads.
A road connects 2 and only 2 houses.
A road connecting houses u and v has a
repair cost w(u, v).
Goal: Repair enough (and no more) roads
such that
1.
everyon
Elementary Graph Algorithms
CIS 606
Spring 2010
Graph representation
Given graph G = (V, E). In pseudocode,
represent vertex set by G.V and edge set
by G.E.
G may be either directed or undirected.
Two common ways to represent graphs for
algorithms:
1. Adj
Greedy Algorithms
CIS 606
Spring 2010
Greedy Algorithms
Similar to dynamic programming.
Used for optimization problems.
Idea
When we have a choice to make, make the
one that looks best right now. Make a locally
optimal choice in hope of getting a globally
Dynamic Programming
CIS 606
Spring 2010
Dynamic Programming
Not a specific algorithm, but a technique
(like divide-and-conquer).
Developed back in the day when
programming meant tabular method
(like linear programming).
Doesnt really refer to computer
pro
Red-Black Trees
CIS 606
Spring 2010
Red-black trees
A variation of binary search trees.
Balanced: height is O(lg n), where n is the
number of nodes.
Operations will take O(lg n) time in the
worst case.
Red-black trees
A red-black tree is a binary search t
Binary Search Trees
CIS 606
Spring 2010
Search trees
Data structures that support many
dynamic-set operations.
Can be used as both a dictionary and as a
priority queue.
Basic operations take time proportional to the
height of the tree.
For complete binary
Hash Tables
CIS 606
Spring 2010
Hash tables
Many applications require a dynamic set
that supports only the dictionary
operations INSERT, SEARCH, and
DELETE. Example: a symbol table in a
compiler.
A hash table is effective for implementing
a dictionary.
Th
Quicksort
CIS 606
Spring 2010
Quicksort
Worst-case running time: (n2).
Expected running time: (n lg n).
Constants hidden in (n lg n) are small.
Sorts in place.
Quicksort
Quicksort is based on the three-step
process of divide-and-conquer.
To sort the subar
Heapsort
CIS 606
Spring 2010
Overview
Heapsort
Sorts in placelike insertion sort.
O(n lg n) worst caselike merge sort.
Combines the best of both algorithms.
To understand heapsort, well cover heaps
and heap operations, and then well take a
look at priorit
Divide-and-Conquer
CIS 606
Spring 2010
Analyzing Divide-and-Conquer
Algorithms
Use a recurrence to characterize the
running time of a divide-and-conquer
algorithm.
Solving the recurrence gives us the
asymptotic running time.
A recurrence is a function is
Growth of Functions
CIS 606 Spring 2010
Asymptotic Notation
O-notation
O(g(n) = cfw_ f(n): there exist positive constants
c and n0 such that 0 f(n) c g(n) for all n
n0 .
Asymptotic Notation
g(n) is an asymptotic upper bound for
f(n)
If f(n) O(g(n), we wr
Introduction
CIS 606 Spring 2010
The sorting problem
Input: A sequence of n numbers ? a1,
a2, , an ? .
Output: A permutation (reordering) ? a1,
a2, , an ? of the input sequence such
that a1 a2 an.
The sequences are typically stored in
arrays.
We also refe
CIS 600 Advanced Computer
Architecture
Lecture 6 Instruction Level
Timothy Arndt
Computer and Information Science
Parallelism
Cleveland State University
Review from Last Time #1
Leverage Implicit Parallelism for Performance:
Instruction Level Parallelism
CIS 600 Advanced Computer
Architecture
Lecture 3 - Introduction & Pipeline
Review
Timothy Arndt
Computer and Information Science
Cleveland State University
Fallacies and Pitfalls (1/2)
Fallacies - commonly held misconceptions
When discussing a fallacy,
CIS 600 Advanced Computer
Architecture
Lecture 2 - Introduction
Timothy Arndt
Computer and Information
Science
Cleveland State University
Review from last lecture
Computer Architecture > instruction sets
Computer Architecture skill sets are different
5
SPR 12
McIntyre
CIS 606
Assignment 1
Feb. 16, 2012
In this assignment explores the minimum coloring problem for graphs which is exponential time complexity. You will write
two java methods which address the problem using 1. a recursive method called exhau
Class Graph this represents he entire graph, all methods are static
static void generateFixedSet(int n) this will generate a graph with n verticies. Given the same N, it
will always generate the same graph
static void generateRandomSet(int n) this will ge
Syllabus Template CIS Department Updated September 2011
Cleveland State University
CIS 601 Graduate Seminar in Computer and Information Science
Section 1: 2:45pm 3:35pm M
Prerequisites: Completion of MCIS preparatory program
Instructor: Timothy Arndt
Offi
Gesture based mobile training
of intercultural Behavior
By
SHASHANKA SUKKALA
CSU ID-2571900
Outline
Introduction
Approach
Implementation
Discussion
Conclusion
introduction
An approach to intercultural training
of nonverbal behavior is presented that
draws
Friendship Prediction and Homophily in
Social Media
By
LUCA MARIA AIELLO
ALAIN BARRAT
ROSSANO SCHIFANELLA
CIRO CATTUTO
BENJAMIN MARKINES and
FILIPPO MENCZER,
Introduction
Online
social sites are very popular nowadays
Great
place to share information, expe
DetectingVisuallySimilarWeb
Pages:
ApplicationtoPhishingDetection
TEH-CHUNG CHEN
SCOTT DICK
JAMES MILLER
Of University of Alberta
Presented By:
Rutvij Shah
2534739
Main Concept
Construction of a question which says web page
difference measurement and impl
CIS 601 Fall 2012 Assignment #2
Write a paper describing Experimental Computer Science. Your paper should be a minimum of 2
full pages and a maximum of 4 full pages (excluding bibliography). You may use the slides at
http:/datasearch.ruc.edu.cn/course/res
CIS 601 Graduate Seminar in Computer and Information Science
Instructor: David McIntyre
Office Phone: (216) 687-4765
E-Mail: mcintyre@cis.csuohio.edu
Meeting time : T 8:00pm-8:50pm
Office location: BU 317
Office hours: M W 5:45-8:00pm; T 7:30-8:00pm
Home
CIS 601 Exam
NAME
April 29, 2008
_
Student Number _
Circle the correct answer in the following 30 true/false or multiple choice questions. I
have taken two questions from each of the 15 presentations (2-16).
2. Improving the Usability of e-Commerce Applic
CIS 600 Advanced Computer
Architecture
Lecture 9 Snooping Cache and
Directory Based Multiprocessors
Timothy Arndt
Computer and Information Science
Cleveland State University
MESI Cache Coherence Protocol
When a protocol has the property that not all
writ