Please write in C display Pages 10. Write function display Pages to do the following a. Return type void b. Parameter list includes i. Parameter that contains the page number, data type integer (i.e., page)ii. One-dimensional array, data type integer, that stores the page allocations (i.e., allocation) c. Display to the console the page number d. Write a looping construct to iterate through the frames (i.e.. FRAMES) i. Display to the console the memory block assigned based on the following logic 1. If the value stored at the current index of array allocation is -1 (ie., INVALID), output a dash (i.e., *-*) 2. Else, output the allocation at the current index of array allocation

Please write in C display Pages 10. Write function display Pages to do the following a. Return type void b. Parameter list includes i. Parameter that contains the page number, data type integer (i.e., page)ii. One-dimensional array, data type integer, that stores the page allocations (i.e., allocation) c. Display to the console the page number d. Write a looping construct to iterate through the frames (i.e.. FRAMES) i. Display to the console the memory block assigned based on the following logic 1. If the value stored at the current index of array allocation is -1 (ie., INVALID), output a dash (i.e., -) 2. Else, output the allocation at the current index of array allocation

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Integer dataSize is read from input. Then, strings and integers are read and stored into string vector subjectList and integer vector pageList, respectively. Lastly, integer pageThreshold is read from input. Set matchCount with the number of element pairs with a page greater than or equal to pageThreshold. Output the subject of each pair found with a page greater than or equal to pageThreshold. End with a newline. Ex: If the input is: 3 Environment 416 Cooking 353 Science 306 349 Then the output is: Environment Cooking Total: 2 By using the following code: #include #include using namespace std; int main() { int numElements; int pageThreshold; int matchCount; unsigned int i; cin >> numElements; vector subjectList(numElements); vector pageList(numElements); for (i = 0; i < subjectList.size(); ++i) { cin >> subjectList.at(i); cin >> pageList.at(i); } cin >> pageThreshold; /* Your code goes here */ cout << "Total: " << matchCount;…
Write a function named allUnique in JavaScript that takes an array as input and returns true if each item appears once only on the list and false otherwise. You may assume the list is flat (i.e., no nested lists). For example, allUnique(['a', 'b', 'c', 1, 2)) should return true allUnique(['a', 'b', 'c', 1, 'a')) should return false allUnique([]) should return true -You can check wither an object obj has a key/property item by calling obj.hasOwnProperty(item) IMPORTANT: Make sure the last line of your submission is module.export = allUnique;
Which of the following data structures store values in contiguous memory? Check all that apply . Vector Linked List Dynamic Array Map Array
Program #11. Show the ArrayStackADT interface 2. Create the ArrayStackDataStrucClass<T> with the following methods: default constructor, overloaded constructor, copy constructor, initializeStack, isEmptyStack, isFullStack, push, peek, void pop 3. Create the PrimeFactorizationDemoClass: instantiate an ArrayStackDataStrucClass<Integer> object with 50 elements. Use a try-catch block in the main( ) using pushes/pops. 4. Exception classes: StackException, StackUnderflowException, StackOverflowException 5. Show the 4 outputs for the following: 3,960 1,234 222,222 13,780
The People class holds an unsorted list of humans. Initially, this list is empty. Existing Human objects may be added to the list using an insert method. Upon inserting a Human object, it is added to the array at the next available position and the position value in incremented. If the position value is equal to the size value, do not insert the Human. Instead, throw an exception that your driver can catch to print an error that the People object is full. Create a People class with the following features: Each People object has a statically allocated array of Human objects. Size attribute representing the maximum size of the array. Position attribute representing the next free position in the array. Default constructor with no arguments. Search method that takes a string argument and returns a Human object. This method returns the first Human object with a name matching the string argument. In other words, pass the name of a Human as a string, search the list of humans for…
Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linkedlist. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If nosuch element exists, output an appropriate message. Provide the definitions of these functions in the class linkedListType. Also writea program to test these functions. (Use either the classunorderedLinkedList or the class orderedLinkedList to testyour function.) Note: Code in c++
Using Dr-Racket, what is the purpose of the number function?(define (number n)(local [(define (abstract int)(* int 11))] (build-list n abstract))) A) Create a list of the first n multiples of 11 starting at 11. B) Create a list of the first n multiples of 11 starting at 0. C) Create a list of the first n multiples of 11 starting at 1. D) Create a list of the first 11 multiples of n starting at 1. E) Create a list of the first 11 multiples of n starting at 0.F) Create a list of the first 11 multiples of n starting at n.
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, there is a need to copy the whole list to a new array B.The new node inserted might cause shifting of the existing elements C.The memory allocation can be very inefficient D.The insertion of a new element is proportional to the size of the list
When a list is implemented using an array, which of the following is FALSE? Select one: A.If the size of the array is insufficient, it whole list will be automatically copied to a new array B.The new node inserted might cause shifting of the existing elements C.The insertion of a new element is proportional to the size of the list D.The memory allocation can be very inefficient
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
The code shown in Figure 2 is part of an application that provides functionality tooperate on a linked list. You can assume that all required libraries will be included inthe final version of the source code. Answer the questions below:i. Briefly describe the purpose of the function AddNew, including a short descriptionof the function’s parameters.ii. Explain the semantics of the following lines of code in Figure 2: 12, 14, 15, as wellas the purpose of the while loop, defined in lines 8-11.ii. Write the code for the function defined by the following prototype:int NextItem(item *); This function should work in the following manner:• When the function is called, it returns the payload of the first element of the listreferenced in the parameter.• Successive calls to the function when using a NULL pointer (e.g.NextItem(NULL); ) will return the payloads of the previously chosen list inorder, one by one in each call.• This functionality should continue until a new pointer is used as a…