DSA ASSIGNMENT 4 REPORT

NAME – RISHI GUPTA

SR NO. - 19729

Implementation detail:
For One Bin Setup there are two make files ‘Onebin.c’&
‘Sheap.c’. Onebin allocates memory location.In this bin size is 50
which means it allocate one memory location . At output it
shows time taken, Internal fragmentation, Number of allocation.
Time taken by Sheap implementation is more than that of
Onebin Implementation.

Output:
Fig1: Sheap.c implementation output
 FIG2: Onebin.c implementation output

Observations:
By experimenting multiple times on Polynomial. It can be concluded that
average time for Sheap implementation is more than time taken for Onebin
implementation.

Space & Time Complexity:

To perform timing comparisons, we are timing only the memory management
calls that are made as part of the polynomial programs. This allows us to
compare the allocators directly without having to worry about external factors
It can be show that OneBin allocator is well performed to the Sheap
allocator. And, this is expected as both the allocation and de-allocation
operations of OneBin are order of O(1).
Also, when it comes to memory efficiency, OneBin is well. The reason being
that we have specialized OneBin so that each of the fixed size bins have exactly
the size required by the Polynomial program.