S
semooo
hi all plz im in the problem i should be to send my home work tomorro
plz plz i dont have the solution i need it,plz if i dont get yh
solution i will failed in data structure in my university i went t
hospital i still in it 1 month there is no time next week i will make
exams(incomplete)so i need your help plz my freinds.
I have three simple question with coding problems in data structure i
c++
thess are :
1)suppose that you are finanicier and purchase 100 shares of stock i
company X , in each of january , april , and september and sell 10
shares in each of june and november
the price per share in these months were
jan apr jun sep nov
$10 $30 $20 $50 $30
determine the total amount in your capital gain or loss , using
a)FIFO accounting
b)LIFO accounting
that is assuming that you keep your stock certificate in
a)a queue or
B) a stack.
the 100 shares you still own at the end of the year
dont enter the calculation.
question number 2:
write the methode to implement queues by the simple but slow techniqu
of keeping the front of queue always in the first position of a leane
array.
question number 3:
write the method to implement queues where the implementation does no
keep account of the entries in the queue but instead use the specia
conditions
rear=-1
and
front=0
to indicate an empty queu
plz plz i dont have the solution i need it,plz if i dont get yh
solution i will failed in data structure in my university i went t
hospital i still in it 1 month there is no time next week i will make
exams(incomplete)so i need your help plz my freinds.
I have three simple question with coding problems in data structure i
c++
thess are :
1)suppose that you are finanicier and purchase 100 shares of stock i
company X , in each of january , april , and september and sell 10
shares in each of june and november
the price per share in these months were
jan apr jun sep nov
$10 $30 $20 $50 $30
determine the total amount in your capital gain or loss , using
a)FIFO accounting
b)LIFO accounting
that is assuming that you keep your stock certificate in
a)a queue or
B) a stack.
the 100 shares you still own at the end of the year
dont enter the calculation.
question number 2:
write the methode to implement queues by the simple but slow techniqu
of keeping the front of queue always in the first position of a leane
array.
question number 3:
write the method to implement queues where the implementation does no
keep account of the entries in the queue but instead use the specia
conditions
rear=-1
and
front=0
to indicate an empty queu