Below the link is our final study guide questions without the answer.
Some of questions are ambiguous, but it does not matter. If you can
not answer some of questions or not sure, just list possible answer or
skip it. Thank you.

http://boole.cs.atu.edu/~morell/classes/3213/exams/finalstudy.html

You may want to consider raising your price, that is quite a nice big
collection of questions there.

8 cts per question not counting the fee google asks , I doubt there
will be many takers

Hmm, basically I don't not assume that the taker would answer all of
the question due to there are a lot of trick question and some of
question just ambiguous. I just to want the taker use his or her known
knowledge to solve the problem. However, if the taker do really good
job, I will add some tips for him. I have done some of the problems,
so that the taker can skip or check these problems. If you want to
test your data structure knowledge, you could try some of these
questions.
1)c
2)e
3)b
4)
5)b
6)a
7)d
8)a
9)
10)c
11)
12)
13)
14)
15)c
16)
17)a
18)
19)
20)
21)d
22)
23)
24)
25)
26)d
27)b
28)
29)
30)b
31)
32)
33)
34)d
35)d
36)
37)
38)
39)
40)a
41)
42)
43)a
44)d
45)
46)
47)b
48)d
49)
50)
51)c
52)
53)
54)
55)d
56)
57)
58)
59)
60)
61)

So you are looking for us to take your exam for you.  I know this is
about data stuctures, but some of us have ethics.

It is just a study guide. It is the test that our instrutor had been
given for last semester, and he gave us to study about that is why he
put link online. I don't really mind if I can get answer or not
becuase our final test questions will be changed. I just want to save
some time for reviewing. I think it is nothing about ethics. Thank for
your attiention to this question.

Answers for question :

22)Doubling the size of the input quadruples the running time
Since Algorithm A is order of n square (n^2) so when value of n
increase by 2 times the actual time is increased by 2 square i.e 4
times ...

23)Doubling the size of the doubles the running time
Since Algorithm A is in O(n) so when n increases by 2 times the actual 
time increase by that much amount ie 2 times ..
please note : there  is great difference between the (n^2) and (n) i.e one is 
one is quare and other is just multiple ...

24)Doubling the size of the input leaves the running time alone
since the order of algorithm is(1) i.e constant the time does not increase 
by increase in number of input as processing time is not related to
number of inputs but it is constant .. irrespective of number of
inputs ..

25) Doubling the size of the input increases the running time by one step
since the alogrithm is order of (log n) if input size is double 
the order is (log 2n)
now log 2n= log n + log 2
if the base is 2 than log 2=1
so new order log 2n= log n + 1

so the processing time is  increased by 1 step ..

more answers later 

Thanxs ,
Samrat.A.Barve

Answers for question

41)In selecting the pivot for quicksort the best choice is The median
of the array...
since the sorting depends on pivot value , the pivot value should be the 
middle value  of given inputs .. it should not be the highest and lowest value 
as middle value in pivots divides given number of inputs in exactly 2 parts 
which when continued further .. the order of sorting becomes( n log n )

43)Bubble sort is generally considered the worst sort because it has
exessively many comparisons .. since each input is comapred with every
other input ...