function calls for C$++$ codes.

main.cpp

using namespace std;

ASListR csvtoASListR$($string csvfile$)\{$

$//$ Implement your logic to read data from csv file and populate an ASListR object

$//...($replace with your actual implementation$)$

$//...($consider error handling$)$

ASListR retCCList$(205)$; $//$ Modify size as needed

return retCCList;

$\}$

int main$($int argc, char$**$ argv$)\{$

ASListR cpu $=$ csvtoASListR$("$cpu$.$csv$")$;

int k;

cout $<<$ "Enter value for k: $"$;

cin $>>$ k;

cout $<<"$

Elements with Cores exceeding $4\mathrm{.}0$:

$"$;

print AttributeExceedingValue$($cpu$,4\mathrm{.}0)$; $//$ Replace with actual function call

cout $<<"$

$"<<$ k $<<"$ highest elements by Cores:

$"$;

printElementsMatchingKHighestOrLowest$($cpu$,$ k$,$ true$)$; $//$ Replace with actual function call

cout $<<"$

Every $"<<$ k $<<"$th element:

$"$;

printEveryKthElement$($cpu$,$ k$)$; $//$ Replace with actual function call

return

ASListR.h

private:

int length;

int MAXSIZE;

cpus$*$ ListItems;

$\}$;

ASListR.cpp

ASListR::ASListR$($int arraysize$)\{$

length $=0$;

MAXSIZE $=$ arraysize;

ListItems $=$ new cpus$[$MAXSIZE$]$;

$\}$

ASListR::~ASListR$()\{$

delete$[]$ ListItems;

$\}$

void ASListR::PutItem$($cpus pitem$)\{$

int aloc $=0$;

bool moreToSearch $=$ aloc $<$ length;

while $($moreToSearch$)\{$

if $($pitem$.$Cores $>$ ListItems$[$aloc$].$Cores$)\{$

moreToSearch $=$ false;

$\}$ else $\{$

aloc$++$;

moreToSearch $=$ aloc $<$ length;

$\}$

$\}$

for $($int i $=$ length; i $>$ aloc; i$--)\{$

ListItems$[$i$]=$ ListItems$[$i $-1]$;

$\}$

ListItems$[$aloc$]=$ pitem;

length$++$;

$\}$

Function calls where code needs them.

A$.$ BST chosen attribute that exceeds certain value.

B$.$ Print elements from a PQ heap matching k highest or k lowest value in the column

C$.$ print out every kth element loaded into a CLQueue