This preview shows pages 1–3. Sign up to view the full content.
1
Department of Computer Science and Engineering
CSE 2011:
Fundamentals of Data Structures
Winter 2009,
Section Z
Instructor:
N. Vlajic
Date:
April 14, 2009
Midterm Examination
Instructions:
•
Examination time:
75 min.
•
Print your name and CS student number in the space provided below.
•
This examination is closed book and closed notes. No calculators or other computing devices
may be used.
•
There are 6 questions. The points for each question are given in square brackets, next to the
question title. The overall maximum score is 100.
•
Answer each question in the space provided. If you need to continue an answer onto the back
of a page, clearly indicate that and label the continuation with the question number.
FIRST NAME:
_________________________
LAST NAME:
_________________________
STUDENT #:
_________________________
Question
Marks
1
/ 20
2
/ 20
3
/ 24
4
/ 10
5
/ 14
6
/ 12
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
1.
True/False
[20 points]
Circle True or False, as appropriate.
Question
Answer
1.
If f(n)
∈
O(g(n)), then g(n) is a lower bound on f(n).
True
False
[2 points]
2.
Function n
⋅
log(n) grows faster than (log(n))
2
True
False
.
[2 points]
3.
f(n) = 5n
3
+ 100
⋅
n
⋅
log(n)
is
Ω
(n
3
True
False
).
[2 points]
4.
Algorithms of complexity 2
n
True
False
⋅
log(n) are called unfeasible.
[2 points]
5.
In Java, compiletime errors are generally preferred over
runtime errors.
True
False
[2 points]
6.
Autoboxing (in Java 5) occurs when a wrapper object is
converted to the corresponding primitive type.
True
False
[2 points]
7.
The running time (RT) of binary search on a sorted array is:
average case RT = O(log(n)), worstcase RT = O(n).
True
False
[2 points]
8.
Extensible array with doubling always provides better
performance than extensible array with fixed increments with
respect to
set
(int k, E e)
1
True
False
method.
[2 points]
9.
Three singly linkedlists of sizes log(n), n and n
2
True
False
, respectively,
can be merged into one singly linkedlist in O(1) time,
assuming we are not concerned with the
ordering of elements in the resulting linkedlist.
[2 points]
10.
When storing and accessing a set of items with equal
True
False
access
frequencies, a selforganizing list based on “countmethod”
strategy should always be the preferred choice over a self
organizing list based on “movetofront” strategy.
[2 points]
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 10/30/2010 for the course CSE 2011 taught by Professor Nguyen during the Spring '10 term at Maple Springs Baptist Bible College.
 Spring '10
 nguyen
 Data Structures

Click to edit the document details