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 2013
Assignment #2
Due date: November 15, 2013, before 12pm (noon)
Instructor: Professor B. Jaumard
Oce: EV 3.189
Email: bjaumard@cs
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
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: bjaumard@cse.concordia.ca
Questi
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: bjaumard@cse.concordia.ca
Questi
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
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/4: Algorithm Design Techniques
Fall 2014
MidTerm  Close book exam  2:30 hours
Instructor: Professor B. Jaumard
Oce: EV 003.115
Email: bjaumard@cse.concordia.ca
First
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/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
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
.
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
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
Technische Universitat Munchen
Fundamental Algorithms
Chapter 6: AVL Trees
Michael Bader
Winter 2011/12
M. Bader: Fundamental Algorithms
Chapter 6: AVL Trees, Winter 2011/12
1
Technische Universitat Munchen
Part I
AVL Trees
M. Bader: Fundamental Algorith
AVL TREES
Binary Search Trees
AVL Trees
AVL Trees
1
Binary Search Trees
A binary search tree is a binary tree T such that
 each internal node stores an item (k, e) of a
dictionary.
 keys stored at nodes in the left subtree of v are less
than or equal
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

Probability
Review
Part I
Design and Analysis
of Algorithms I
Topics Covered
Sample spaces
Events
Random variables
ExpectaAon
Linearity of ExpectaAon
See also:
LehmanLeighton notes (free PDF)
Wikibook on D
Assignment No.2
Name:
ID:
Section:
2
Solution
Send signals at 20 W, 21 W, . . . , 2k W, until it is received. Note that when k = log2 n, we have n = 2log2 n
2log2 n , hence the message will be received and the algorithm is correct. The total used power w
CONCORDIA UNIVERSITY
DEPARTMENT OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING
COMP 6651: Algorithm Design Techniques
Fall 2014
Quiz # 2
First Name
Last Name
ID#
Question 1
1. Recall the 5 steps of the select algorithm for computing the k order of a set of
CHAPTER 2. RECURRENCE RELATIONS
Exercise 2.14
Solve the system of recurrence relations
sn = 8sn1 9tn1
tn = 6sn1 7tn1 .
Initial conditions: s0 = 4, t0 = 1.
Solution
Subtracting the second recurrence relation to the rst recurrence relation leads to:
sn tn =
CHAPTER 2. RECURRENCE RELATIONS
Exercise 2.15
The analysis of an algorithms leads you to the following recurrence relation:
an = an/2 + an/4 + n
n 2,
a1 = a2 = a3 = 1.
Give an asymptotic solution to this recurrence.
Solution
Change of variable: n = 2k , a
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
Solution of Question 4  Assignment 1
*
First note that, the direction of the ships doesnt affect the problem that much. You can easily convert
the ones running westbound to the ones running eastbound, by just converting the sign of their position.
This i
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
Assignment No.4
Name:
ID:
Section:
1 20 bonus points
Solution
Search engines use a web crawler to index content on the web, which employs a compressed trie data
structure for storage of the web pages. A standard trie is an ordered tree where the children
Assignment No.3
Name:
ID:
Section:
2 30 points
Solution
Let COST ( j) denote the optimum cost of the conguration on server j, a server in which we place a copy
of the le. We need to determine the rst server before j that contains the le. Let this server b
COMP 6651: Algorithm Design Techniques
Concordia University
Department of CSE
Fall 2016
Instructor: Professor Lata Narayanan
Office: EV 3.163 Phone: 8482424 x3029
email: lata@encs.concordia.ca
Course website: https:/users.encs.concordia.ca/comp6651 2
Ple