CIS 114 Spring 2008
W. Rutkowski
Print Name
___________________________________________________________
Do not open this exam until instructed to do so. The exam consists of
5 pages, numbered 1 to 5. Before you start make sure you have all
pages. There are 5 problems worth 20 points each. Write all answers on
the exam in the space provided in each problem.
During this exam it is prohibited to:
1)
Exchange information with any person other than the exam proctor.
2)
Use any electronic aid, including calculators.
3)
Use any books or notes.
4)
Leave the exam room before you turn in your exam.
I have read and understood all of the instructions above. On my honor,
I pledge that I have not violated the provisions of the NJIT Academic
Honor Code.
_________________________________________________
Signature and date
Page 1 of 5
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
1)
In each pair of functions circle the one that is of higher order:
a)
n·log(n)
n
2
b)
2
n
n
3
3
n
n
2
c)
log
2
(n)
log(n
2
)
d)
2
n
/n
2
n
10
e)
log(log(n))
n
1/2
log(n)
2)
Array
q
represents a queue implemented using a circular array. Assume
you have access to two int data members named
in
and
out
where
in
is
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 Data Structures, Analysis of algorithms, Computational complexity theory, Worstcase complexity, Bestcase complexity

Click to edit the document details