CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2015
Assignment #3
You need to submit your assignment together with the originality form
No late submission will be accepted.
Due da
CHAPTER 2. RECURRENCE RELATIONS
Exercise 2.12
Solve the following recurrence relations using the characteristic equation:
(i) tn = 6tn1 9tn2 + (n2 5n)7n
(ii) tn = 2t n + 6n3
5
for
n > 1,
for
n > 1,
t0 = 0, t1 = 1.
n a power of 5 , t1 = 6.
Solution of Recu
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2015
Assignment #4
You need to submit your assignment together with the originality form
No late submission will be accepted.
Due da
CHAPTER 4. DIVIDE & CONQUER ALGORITHMS
Exercise 4.3
In safetycritical environments like nuclear reactors, it is important to ensure a sporadic hardware or software failure cant bring down a computer system. One way to
do this is to introduce redundancy b
Af
I
I
1
r'
COMP 6651: Algorithm Design Techniques
' Winter 2012 Midterm Examination
Time: 1 hour 30 minutes
Student Narne: /méa 91/3/96? 1 Student ID; 9/ l 3 O qr?
Notes: _u
(a) Read every question very carefully before attempting to solve it.
(b) Answ
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2013
Assignment #2
Due date: November 15, 2013, before 12pm (noon)
Instructor: Professor B. Jaumard
Oce: EV 3.189
Email: [email protected]
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/4: Algorithm Design Techniques
Fall 2010
MidTerm  Close book exam  2:30 hours
Instructor: Professor B. Jaumard
Oce: EV 003.189
Email: [email protected]
Questi
Homework 9
Solutions
Problem 1 In this problem you will show execution of the minimum spanning tree algorithms
that you studied in class on the following graph:
START
10
15
25
40
20
35
30
66
38
41
8
5
62
12
(a) Trace the execution of Prims algorithm to fi
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2015
Assignment #1
Due date: Sept. 24, 2015, before noon
Deadline for demonstration is on Sept. 24, 2015, 5:30 PM
Instructor: Profes
CSE 373, Spring 2012
Midterm Solutions
0. The First Question (0 points)
What is the answer to this first question?
e
1. BigOh (5 Points)
public int add100(int[] array) cfw_
if (array.length < 100) cfw_
return 0;
int sum = 0;
for (int i = 0; i < 100; i+)
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/4: Algorithm Design Techniques
Fall 2010
MidTerm  Close book exam  2:30 hours
Instructor: Professor B. Jaumard
Oce: EV 003.189
Email: [email protected]
Questi
a)
/.
COMP 6651 Algorithms Design Techniques
Midterm Exam
May 27, 2011
This is ciosed book exam
No calculators aiiowed
Examination should be written in ink
If doublit exists as to the interpretation of any quastion, the student is
urged to make a clear st
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2015
Assignment #1
Due date: October 9, 2015, before noon
You need to submit your assignment together with the originality form
Dead
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651: Algorithm Design Techniques
Fall 2010
Quiz  Lecture 1
First Name
Last Name
ID#
Question 1
Solve the following recurrence equation
d1 = 2
and dn = dn/2 + 1,
1
(n 2)
Qu
CHAPTER 9. DYNAMIC PROGRAMMING
Exercise 9.11
Book of Kleinberg and Tardos [10]  Exercise 14 in Chapter 6
A large collection of mobile wireless devices can naturally form a network in which the
devices are the nodes, and two devices x and y are connected
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Fall 2015
Assignment #3
Due date: November 13, 2015, before noon
You need to submit your assignment together with the originality form
No
CS 473
Homework 5 solutions
Fall 2012
1. Suppose we can insert or delete an element into a hash table in O(1) time. In order to ensure that our hash
table is always big enough, without wasting a lot of memory, we will use the following global rebuilding
r
International Journal of Computer Science and Artificial Intelligence
Sept. 2014, Vol. 4 Iss. 3, PP. 6367
Web Crawling Algorithms
Aviral Nigam
Computer Science and Engineering Department,
National Institute of Technology  Calicut, Kozhikode, Kerala 6736
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
CHAPTER 10. UNIONFIND DATA STRUCTURES
Exercise 10.1
Depth Determination. Cormen et al. Problem 212 p. 519
In the depthdetermination problem, we maintain a forest F = cfw_Ti of rooted trees under three
operations:
 MakeTree(v) creates a tree whose on
CHAPTER 9. DYNAMIC PROGRAMMING
Exercise 9.1
For each of the following problems, establish a recursive formula that relates the optimal solution of a large problem to optimal solutions of smaller subproblems.
(a) Making change. You are given n types of coi
CHAPTER 6. GREEDY ALGORITHMS
Exercise 6.8
A ski rental agency has m pairs of skis, where the height of the ith pair of skis is si . There
are n skiers who wish to rent skis, where the height of the ith skier is hi . Ideally, each skier
should obtain a pai
CHAPTER 9. DYNAMIC PROGRAMMING
Exercise 9.3
Midterm Fall 2007
We have a set of n objects, denoted by 1, 2, ., N , which we want to group in clusters that
consist of consecutive objects. For each cluster i + 1, i + 2, . . . , j, there is an associated cost
.
Lecture 4: Graph Algorithms
October 3, 2014
.
.
.
.
.
COMP 6651 / Fall 2014
Dr. B. Jaumard
Outline
.
1
. . Maximum Flow
Maximum Flow
.
Maximum Flow Problem
COMP 6651 / Fall 2014 , Dr. B. Jaumard
3
Maximum Flow
.
FordFulkerson Algorithm
.
F ORD F ULKER
if
m
P(n)
.
=
n .
for
7
=
.
between v and d :
IL
+
<
but
d=gb
We have d
here.
, and
but
vn/30 as
, sothat
=
,
.
+
+
+
+
+
(
<
=
d)
27000
1575
n ,
n ,
n .
5.43
,
+







.
5

CHAPTER 1. ASYMPTOTIC NOTATIONS
Exercise 1.1
Compare the following pairs of functions in terms of order magnitude. In each case, say
whether f (n) = O(g(n), f (n) = (g(n), and/or f (n) = (g(n). Justify your answers.
f (n)
g(n)
a.
n
log n
b.
log n
log(4n2
COMP 6651 / Fall 2015
Dr. B. Jaumard
Lecture 3: Greedy Algorithms
September 26, 2014
Outline
1
Denitions
2
An Activity Selection Problem
3
Huffman codes
4
Memory Caching
5
Scheduling & Lateness
6
Exercises
Denitions An Activity Selection Problem Huffman c
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651/2: Algorithm Design Techniques
Winter 2017
Assignment #3
Due date: March 23, 2017, before midnight
You need to submit your assignment together with the originality form
CHAPTER 13. SETS AND SEQUENCES
Exercise 13.4 (i) A palindrome is any string that is the same as its reversal, such as x, abba,
or redivider. Describe and analyze an algorithm that computes the longest palindrome that
is a (not necessarily proper) prefix o
DATABASESYSTEMS
TheCompleteBook
SecondEdition
HectorGarciaMolina
JeffreyD.UHman
JenniferWidom
Department of Computer Science
Stanford University
PEARSON
Prentice
Hall
PearsonEducationInternational
TableofContents
1TheWorldsofDatabaseSystems1
1.1TheEvoluti