Fall 2018 Midterm Examination: Questions 1 2 3 4 5 6 7 Total Points 10 10 10 10 10 25 25 100 Score

(COMP3711)[2018](f)midterm~=97lpo^_79477.pdf downloaded by khcheungaq from http://petergao.net/ustpastpaper/down.php?course=COMP3711&id=15 at 2020-10-06 10:43:21. Academic use within HKUST only.
HKUST – Department of Computer Science and Engineering

COMP 3711: Design and Analysis of Algorithms
Fall 2018 Midterm Examination
Date: Monday, 15 Oct, 2018 Time: 19:00–21:00
Name: Student ID:

Email: Lecture:
Instructions
• This is a closed book exam. It consists of 11 pages and 7 questions.

• Please write your name, student ID, email, lecture section in the space
provided at the top of this page.
• The math sheet can be found at the last page.
• All solutions must be written on the front (numbered) side of the pages.
Page backs may only be used for rough work. Nothing written on the backs
of pages will be marked.
• The default base for logarithms will be 2, i.e., log n will mean log2 n. If
another base is intended, it will be explicitly stated, e.g., log3 n.
Questions 1 2 3 4 5 6 7 Total
Points 10 10 10 10 10 25 25 100
Score
Problem 1: Time Complexity [10 pts]
We have two algorithms, A and B. Let TA (n) and TB (n) denote the time
complexities of algorithm A and B respectively, with respect to the input
size n. Below there are 8 different cases of time complexities for each
algorithm. Complete the last column of the following table with “A”, “B”,
or “U”, where:
– “A” means that for large enough n, algorithm A is always faster;

– “B” means that for large enough n, algorithm B is always faster;
– “U” means that the information provided is not enough to justify
stating that, for large enough n, one algorithm is always faster than
the other.
Case TA (n) TB (n) Faster

1 Θ(n1.1 ) Θ(n /(log n)3 )
1.2
2 O(log n) Θ(log log n)

3 O(n2 ) O(n1.9 log n)
4 Ω(n2 ) O(n1.93 )
5 Θ(n) Θ(3log4 n )
Answer: 1) A, 2) U, 3) U, 4) B, 5) B
Grading Scheme: 2 points for each
2
Problem 2: Comparison-Based Sorting [10 pts]
Let the following comparison-based sorting algorithms:

Insertion Sort (IS)
Merge Sort (MS)
Randomized Quick Sort (QS)
Heap Sort (HS)
In the following questions, indicate each algorithm by its initials.
There may be multiple algorithms for each question.
(1) Which of the above algorithms must be recursive?
(2) Which of the above algorithms is stable?
(3) Which of the above algorithms performs the minimum number of

comparisons when the input array is already sorted?
(4) Which of the above algorithms is optimal in terms of worst case

running time?
(5) Which of the above algorithms uses the least amount of memory
(working space)?
Answer: (1) MS and QS, (2) IS and MS, (3) IS, (4) MS and HS, (5) IS and HS
Grading Scheme: 2 points for each
3
Problem 3: Randomized algorithm [10 pts]

Suppose we place n items randomly into m lockers, i.e. each locker has
probability m1 to contain a particular item. What is the expected number
of pairs of items in the same locker?
For example, let n = 5 and m = 2. After the placement of the items,
suppose locker 1 contains three items {i1 , i2 , i3 } and locker 2 contains two
items {i4 , i5 }. Then (i1 , i2 ), (i1 , i3 ), (i2 , i3 ) and (i4 , i5 ) are the pairs in the
same locker.
Answer: This problem is the same as the birthday paradox, by viewing the n items
as people and the m lockers as days. Thus, the expected number of pairs
is n2 /m.

4
Problem 4: Min Heaps [10 pts]

Given a min-heap in the array representation as follows,
3 14 7 31 15 8 10 34 32 17 18 9 12 19
(a) Show the new array after performing an extract-min operation.
(b) Show the new array after inserting 4 in the original array.
Answer:
(a)
7 14 8 31 15 9 10 34 32 17 18 19 12
(b)
3 14 4 31 15 8 7 34 32 17 18 9 12 19 10
5
Problem 5: Counting Sort [10 pts]

You are given an array A of n integers in the range [1 . . . k]. Describe a
Θ(n + k) algorithm that generates a new array C, such that using C you
can answer in constant time any query of the form “how many elements of
A are in the range (x, y]” (1 ≤ x < y ≤ k).
Answer: You generate the same array C[1 . . . k] as in counting sort, i.e. the element
C[i] is the total number of elements smaller or equal to i. The answer to
the query is: C[y] − C[x].
6
Problem 6: Divide and Conquer [25 pts]

Let A an unsorted array of n distinct numbers. Design an O(nlogk) al-
gorithm that partitions A into k block of n/k mumbers, such that all the
numbers in block i are smaller than all the numbers in block i + 1, for
1 ≤ i < k. The numbers within each block do not have to be sorted. For
instance, if n = 16 and k = 4, a partitioning that satisfies these conditions
is [(2, 13), (7, 5, 6), (13, 10, 9), (18, 19, 15)]. Assume that k << n, and that
n, k are powers of 2.
Answer: 1. Find the median of the array and partition it into two sub-arrays: O(n)
2. Recursively solve two subproblems until we have k blocks.
So T (n) = 2T (n/2) + cn. The base case is T (n/k) = 1. So, T (n) =
O(n log k).
7
Problem 7: Greedy Algorithms [25 pts]

We are given n sorted lists L1 , L2 , . . . Ln , which need to be merged into a
single sorted list. We can merge only two lists at a time. Describe a greedy
algorithm which determines the optimal order for merging all lists, i.e. the
order that minimizes the total number of comparisons. Discuss the running
time of your algorithm.
Clarification: The algorithm returns the optimal order, but it does not
perform the actual merging. The lists have different number of elements.
Answer: Same as Huffman coding algorithm.

Create a min-heap T [1 . . . n] based on the n initial sizes.
While (the heap size ≥ 2) do
delete from the heap with the two smallest values |Li and |Lj |.
create a node of size |Li | + |Lj | whose children are |Li | and |Lj |.
insert the value |Li | + |Lj | into the heap.
Time complexity: Θ(n log n).

Fall 2018 Midterm Examination: Questions 1 2 3 4 5 6 7 Total Points 10 10 10 10 10 25 25 100 Score

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Fall 2018 Midterm Examination: Questions 1 2 3 4 5 6 7 Total Points 10 10 10 10 10 25 25 100 Score

Загружено:

Авторское право:

Доступные форматы

(COMP3711)[2018](f)midterm~=97lpo^_79477.pdf downloaded by khcheungaq from http://petergao.net/ustpastpaper/down.php?course=COMP3711&id=15 at 2020-10-06 10:43:21. Academic use within HKUST only.

HKUST – Department of Computer Science and Engineering

Date: Monday, 15 Oct, 2018 Time: 19:00–21:00

Name: Student ID:

• This is a closed book exam. It consists of 11 pages and 7 questions.

Problem 1: Time Complexity [10 pts]

– “A” means that for large enough n, algorithm A is always faster;

Case TA (n) TB (n) Faster

2 O(log n) Θ(log log n)

Problem 2: Comparison-Based Sorting [10 pts]

Let the following comparison-based sorting algorithms:

(2) Which of the above algorithms is stable?

(3) Which of the above algorithms performs the minimum number of

(4) Which of the above algorithms is optimal in terms of worst case

Problem 3: Randomized algorithm [10 pts]

Problem 4: Min Heaps [10 pts]

(a) Show the new array after performing an extract-min operation.

Problem 5: Counting Sort [10 pts]

Problem 6: Divide and Conquer [25 pts]

Problem 7: Greedy Algorithms [25 pts]

Answer: Same as Huffman coding algorithm.

Time complexity: Θ(n log n).

Вам также может понравиться