■DON'T use assert in constructors, destructor, operator= (assignment operator) and resize.Parameters (that carry preconditions) to be checked for validity and appropriately adjusted where needed.Example: Parameter (specifying initial capacity) of a one-parameter constructor should be checked and appropriately adjusted where needed to avoid allocating an array sized less thanExample: Parameter (specifying new capacity) of resize should be checked and appropriately adjusted where needed to enable preservation of existing data and avoid allocating an array sizedless than 1.It's part of caller's responsibility to specify a desired new capacity when calling resize.·Obligation to follow certain ad hoc resizing rule (see under Special Requirement above) should be relevant only to the caller.Implementation of resize should play no part in the enforcement of any such rule.(In other words, it's not logically sound for implementation to incorporate any aspects of any resizing rule.)(Implementation of resize should do appropriate checking/adjusting, however, as indicated above.).Resizing can be expensive so resize should be called sparingly.·It's usually unwise to resize to just what's immediately needed.(This is actually the main reason for the resizing rule specified under Special Requirement above.)Similarly, one'd call resize to free up some unused capacity only under truly warranted circumstances.(For simplicity of this excercise, let's NOT do any such resizing at all.) When calling resize (while implementing some of the member functions) to increase the capacity of the dynamic arrays, use the following resizing rule (unless the new capacity has to be something elsehigher as dictated by other overriding factors):"new capacity" is "roughly 1.5 * old capacity" and at least "old capacity + 1".The latter (at least "old capacity + 1") is a simple way to take care of the subtle case where "1.5*old capacity" evaluates (with truncation) to the same as "old capacity".(TIP: "int(1.5*old capacity) + 1" is a formula you can use to rather painlessly compute "new capacity" satisfying the above.)

The following code is written in Java language. Define an Array class as below: In the…

When calling resize (while implementing some of the member functions) to increase the capacity of the dynamic arrays, use the following resizing rule (unless the new capacity has to be something else higher as dictated by other overriding factors): ● "new capacity" is "roughly 1.5 * old capacity" and at least "old capacity + 1". The latter (at least "old capacity + 1") is a simple way to take care of the subtle case where "1.5"old capacity" evaluates (with truncation) to the same as "old capacity". (TIP: "int(1.5*old capacity) + 1" is a formula you can use to rather painlessly compute "new capacity" satisfying the above.)

When calling resize (while implementing some of the member functions) to increase the capacity of the dynamic arrays, use the following resizing rule (unless the new capacity has to be something else higher as dictated by other overriding factors): ● "new capacity" is "roughly 1.5 * old capacity" and at least "old capacity + 1". The latter (at least "old capacity + 1") is a simple way to take care of the subtle case where "1.5"old capacity" evaluates (with truncation) to the same as "old capacity". (TIP: "int(1.5*old capacity) + 1" is a formula you can use to rather painlessly compute "new capacity" satisfying the above.)

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

void change_current_directory(char *directory) {} This is to be done in C
Description You are provided a skeleton code in the file student_code.c. Some functions are completely implemented, and some are partially implemented. Additionally, you can add your own functions if required. Complete the program as per following details so that we can have functionality as described in the Synopsis above. All the code in single C file. REMEMBER DO NOT USE sleep(). 1. The given code reads the file's content for you and populates a dynamic array of type struct thread with information about the threads. The threads have filled in this list of threads for you. Additionally, you can check the threadCount variable to see how many threads were created using the input file. If more members are needed, you can add them. You might be able to initialise those extra members during file read if you wish to. 2. The main() already contains the code to read threads from input file. However, there is no code to initialize, execute and synchronize threads. You have to perform these…
Problem 2: Create a ticket spin lock Complete the functions in ticket_spin_lock.cpp to implement a ticket lock that spins while waiting. Some useful hints: • The lock_t* lock struct containts the variables int ticket and int turn. • Use the atomic function_sync_fetch_and_add( int* ticket, int addition ). This function will atomically fetch the value in ticket and add addition to this value. • You may not need to do anything in the destroy function.
Implement the following functions. Each function deals with null terminated C-Style strings. You can assume that any char array passed into the functions will contain null terminated data. Place all of the functions in a single file and then (in the same file) create a main() function that tests the functions thoroughly. You will lose points if you don't show enough examples to convince me that your function works in all cases. Please note the following: You may not use any variables of type string. This means that you should not #include <string>. Also, you may not use any c-string functions other than strlen(). If you use any other c-string functions, you will not get credit. Note, however, that functions such as toupper(), tolower(), isalpha(), isspace(), and swap() are NOT c-string functions, so you can use them. Also note that this prohibition is only for the functions that you are assigned to write. You can use whatever you want in your main() function that tests the…
2. Fill in the for-loop below with the correct parameters to make room for the new value. saved Let's say that you have to write a function to insert an element into an ordered array. It takes an array A, a size, an index and a value. The value needs to be inserted at Aſindex] without losing values that are already in the array. // Assume that the index is found to be within array bounds and there is room to insert. for (int i = ?; ?; ?) { A[i]=A[i-1]; } A[index]=value; size++; O 0; i 0; - O size; i> index; -- O size-1; i>= index; i--
Write a void function that reads a file “a:data.txt” with up to 35 student ids, names and final marks into 3 arrays. When the student name is "quit" stop processing or if 35 array elements have been read then stop processing . The function should return the length of the actual number of students as well as the 3 arrays. In main, show all declarations and show the actual call. You can use the following prototype and data file: (note that in this case length would be 4) const int SIZE = 35; void ReadData( string name[],int id[], int mark[], int& length); data.txt Bob 123456 89 Suki 234567 77 Felix 345678 55 Julie 456789 67 quit in c++ please use basic coding I'm not advanced
Please add an execution chart for this code like the example below. I have provided the code and the example execution chart. : Sample Execution Chart Template//your header files// constant size of the array// declare an array of BankAccount objects called accountsArray of size =SIZE// comments for other declarations with variable names etc and their functionality// function prototypes// method to fill array from file, details of input and output values and purpose of functionvoid fillArray (ifstream &input,BankAccount accountsArray[]);// method to find the largest account using balance as keyint largest(BankAccount accountsArray[]);// method to find the smallest account using balance as keyint smallest(BankAccount accountsArray[]);// method to display all elements of the accounts arrayvoid printArray(BankAccount accountsArray[]);int main() {// function calls come here:// give the function call and a comment about the purpose,// and input and return value if any//open file//fill…