#include #include #include typedef struct ArrayList s void **list; int size; int capacity; int delta capacity; ) ArrayList t, *ArrayList; void *arraylist_delete(ArrayList 1, int index) define *e, ncapacity, **nlist e - null if 1 is not empty and index >= 0 and index < size of 1 then e <- 1->list[index) decrease 1->size once shift elements between index + 1 to left by 1 ncapacity <- capacity of 1/2 if size of 1 <= ncapacity and ncapacity > e then nlist <- realloc(list of 1, ncapacity * size of (void *)) if nlist not null then list of 1 <- nlist capacity of 1 - ncapacity Osto nlist <- (void **)malloc(ncapacity * size of (void )) if nlist not null then memcpy (nlist, list of 1, size of 1 * size of (void )) free list of 1 list of 1 <- nlist capacity of 1 <- ncapacity endif endif endif return e

#include #include #include typedef struct ArrayList s void **list; int size; int capacity; int delta capacity; ) ArrayList t, ArrayList; void arraylist_delete(ArrayList 1, int index) define *e, ncapacity, **nlist e - null if 1 is not empty and index >= 0 and index < size of 1 then e <- 1->list[index) decrease 1->size once shift elements between index + 1 to left by 1 ncapacity <- capacity of 1/2 if size of 1 <= ncapacity and ncapacity > e then nlist <- realloc(list of 1, ncapacity * size of (void *)) if nlist not null then list of 1 <- nlist capacity of 1 - ncapacity Osto nlist <- (void **)malloc(ncapacity * size of (void )) if nlist not null then memcpy (nlist, list of 1, size of 1 * size of (void )) free list of 1 list of 1 <- nlist capacity of 1 <- ncapacity endif endif endif return e

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 13PE

See similar textbooks

Similar questions

09 randArray Part 4 DESCRIPTION Get a value from the user and using a loop, search for the value in the array. Report all the index locations where it is found Report if it is not found anywhere #include <iostream>using namespace std;#include <cstdlib> int main(){ srand(17); const int ARRAYSIZE = 20; int RandArray[ARRAYSIZE]; int i; for (i = 0; i < ARRAYSIZE; i++) RandArray[i] = rand() % 100; for (i = 0; i < ARRAYSIZE; i++) cout <<"randArray["<< i <<"]=" << RandArray[i] << endl; int smallestFoundSoFar=90;int indexOfSmallest = -1;int largestFoundSoFar=-1;int indexOfLargest = -1; for (i = 0; i < ARRAYSIZE; i++) { if (RandArray[i] > largestFoundSoFar) { largestFoundSoFar=RandArray[i]; indexOfLargest = i; } } cout << "\nlargestFoundSoFar=" << largestFoundSoFar << " at index " << indexOfLargest; for (i = 0; i < ARRAYSIZE; i++) { if (RandArray[i] < smallestFoundSoFar) { smallestFoundSoFar=RandArray[i];…
Define the following structures: Manufacturer name : manufacturer’s name country : origin Vaccine vaccine name (e.g. Pfizer) : vaccine type (e.g MRNA) (e.g. $28.5) (e.g. 2 shots) name : type price : total price noofShot : total shots mf : Manufacturer type Declare an array called vaccineList that can store up to 10 Vaccine (refer to Question 4a) records. Initialize the first two elements with the following data: Vaccine Туре Price Shots Manu Origin $19.50 $13.60 Pfizer MRNA 2 Pfizer US Sinovac Whole Virus Sinovac Bio China
C++ You have an array with non-repeating elements. You need the change locations between minumum and maximum elements.Input:77 9 5 4 1 3 0Output:7 0 5 4 1 3 9
Effects on Size and PaddingA flexible array member is treated as having no size when calculating the size of a structure, though paddingbetween that member and the previous member of the structure may still exist:/* Prints "8,8" on my machine, so there is no padding. */printf("%zu,%zu\n", sizeof(size_t), sizeof(struct ex1));/* Also prints "8,8" on my machine, so there is no padding in the ex2 structure itself. */printf("%zu,%zu\n", sizeof(struct ex2_header), sizeof(struct ex2));/* Prints "5,8" on my machine, so there are 3 bytes of padding. */printf("%zu,%zu\n", sizeof(int) + sizeof(char), sizeof(struct ex3));The flexible array member is considered to have an incomplete array type, so its size cannot be calculated usingsizeof.
1. Array Allocator Write a function that dynamically allocates an array of integers. The function should accept an integer argument indicating the number of elements to allocate. The function should return a pointer to the array.
C language. Function write the arraylist_sort function This generic function sorts an array list using the given compare function. l An array list compare Pointer to the function which compares two elements If you cannot write down a generic function which works for all types, write down a function which sorts resturants. If you cannot use function pointers, you can write down multiple functions which sort using different criteria.
A(n) _________ may be used to pass arguments to the constructors of elements in anobject array.
assembly language ctt 9. Counting Nearly Matching ElementsWrite a procedure named CountNearMatches that receives pointers to two arrays of signed doublewords, a parameter that indicates the length of the two arrays, and a parameter that indicates the maximum allowed difference (called diff) between any two matching elements. For each element x(i) in the ﬁrst array, if the difference between it and the corresponding y(i) in the second array is less than or equal to diff, increment a count. At the end, return a count of the number of nearly matching array elements in EAX. Display this value. Write a test program that calls CountNearMatches and passes pointersto two different pairs of arrays. Use the INVOKE statement to call your procedure and pass stackparameters. Create a PROTO declaration for CountMatches. Save and restore any registers (other than EAX) changed by your procedure.
. Complete the program to processes an array of structured data. Complete those portions indicated in the template. The program has defined a structure named Sale. The structure has the following fields: string itemName int quantity double unitPrice The main function call loadUserlnput which returns a pointer to the first Sale element in the dynamically allocated array of Sale elements and an integer for the number of Sale elements in the array. The main function then calls printData to show the sale items including the total of cach sale item and the total of the entire list. Function printData This is the function you need to complete as well as two other helper functions. In the function body, print the report heading. Then iterate through the array received through the parameters and print the data according to the required format. For the total of each item, call getltemTotal. At the end of the report, print the total of the entire sale items by calling getTotal. Test The Program…
Huffman code // C program for Huffman Coding #include<stdio.h> #include<stdlib.h> #define MAX_TREE_HT 100 struct MinHeapNode { char data; unsigned freq; struct MinHeapNode *left, *right; }; struct MinHeap { unsigned size; unsigned capacity; struct MinHeapNode** array; }; struct MinHeapNode* newNode(char data, unsigned freq) { struct MinHeapNode* temp = (struct MinHeapNode*)malloc (sizeof(struct MinHeapNode)); temp->left = temp->right = NULL; temp->data = data; temp->freq = freq; return temp; } struct MinHeap* createMinHeap(unsigned capacity) { struct MinHeap* minHeap = (struct MinHeap*)malloc(sizeof(struct MinHeap)); minHeap->size = 0; minHeap->capacity = capacity; minHeap->array = (struct MinHeapNode**)malloc(minHeap-> capacity * sizeof(struct MinHeapNode*)); return minHeap; } void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) { struct MinHeapNode* t = *a; *a = *b;…
One problem with dynamic arrays is that they don't carry around their size. Create a structure, DynArray which uses a unique pointer for a dynamic array (data), and an int for the size and capacity. dynarray.h #ifndef DYNARRAY_H #define DYNARRAY_H 1 2 3 4 #include #include 7 // Define the DynArray structure here 8 std::ostream& operator>(std::istream& in, DynArray& a); DynArray makeDA (int capacity); 10 11 12 13 #endif memory.cpp 1 #include #include #include "dynarray.h" using namespace std; 2 3 4 int main() { cout « "Array capacity: "; int capacity; cin >> capacity; 7 8 9 10 11 auto a = makeDA (capacity); cout « "Enter up to " > a; 12 13 14 15 16 cout « "a->" « a « endl; 17 }
The following array of structures is used to hold data of your IPC144 grade center strcut grades {char name[101]; unsigned final; unsigned total;} struct grades myClass[25]; Write a function that gets the class grades array as a parameter and prints the list of people who passed the course (a student passes a course if he/she passes the final as well as the total) and their total mark. The function should also print the class average at the end (based on the total marks) void printPassedAverage(struct grades myClass, int size) The output should be like this Students passed:--------------------- John Smith 85 Jane Doe 65 Roy Crowe 80 Julia Stuart 55 Rob Gates 60 Class average: 69