Answered: bytes and finds a block of size mm, if…

Engineering

Computer Science

bytes and finds a block of size mm, if m > nm>n then

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 22SA

See similar textbooks

Similar questions

11.17 (Bucket Sort) Use Python. Show the whole code input and output when done. A bucket sort begins with a one-dimensional array of positive integers to be sorted and a two-dimensional array of integers with rows indexed from 0 to 9 and columns indexed from 0 to n – 1, where n is the number of values to be sorted. Each row of the two-dimensional array is referred to as a bucket. Write a class named BucketSort containing a function called sort that operates as follows: a) Place each value of the one-dimensional array into a row of the bucket array, based on the value’s “ones” (rightmost) digit. For example, 97 is placed in row 7, 3 is placed in row 3, and 100 is placed in row 0. This procedure is called a distribution pass. b) Loop through the bucket array row by row, and copy the values back to the original array. This procedure is called a gathering pass. The new order of the preceding values in the one-dimensional array is 100, 3 and 97. c) Repeat this process for each subsequent…
• R7.21Find the mistakes in the following code. Not all lines contain mistakes. Each line depends on the lines preceding it. Watch out for uninitialized pointers, nullptr pointers, pointers to deleted objects, and confusing pointers with objects. 1 int* p = new int; 2 p = 5; 3 *p = *p + 5; 4 string s = "Harry"; 5 *s = "Sally"; 6 delete &s; 7 int* a = new int[10]; 8 *a = 5; 9 a[10] = 5; 10 delete a; 11 int* q; 12 *q = 5; 13 q = p; 14 delete q; 15 delete p;
C++ The People class holds an unsorted list of humans. Initially, this list is empty. 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 one with that name. If found, return this human. Else throw an…
Q1. Assume X is an array of char such that cahr X[] = “welcome C++II students to pointer camp, come and see the power and comfortable of pointers when it is combined with array. Enjoy camping and find common things between arrays and pointer commands”; Write a function that receives the array X and returns array of pointers to char. Each pointer in this array points to array of char (one word) that contains the phrase “com”. For example the array X has 6 words that each one contains the phrase “com”, they are [welcome, come, comfortable, combined, common and commands], so array of 6 pointers are returned each pointer in the returned array points to a word. Hint: if no words has the phrase “com” a NULL pointer should be returned don't use strstr()... you must write code for this function #in c++
in C++... kth Element Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. PLEASE DON'T reject this question, this is the whole question that I have... so please do it however u can, Thank you!
In c++ please also add comments to each line of code Suppose we have class named NumberList that holds a linked list of double values. In this section you will modify the class by adding recursive member functions. The functions will use recursion to traverse the linked list and perform the following operations: Count the number of nodes in the list. To count the number of nodes in the list by recursion, we introduce two new member functions: numNodes and countNodes. countNodes is a private member function that uses recursion, and numNodes is the public interface that calls it. Display the value of the list nodes in reverse order. To display the nodes in the list in reverse order, we introduce two new member functions: displayBackwards and showReverse. showReverse is a private member function that uses recursion, and displayBackwards is the public interface that calls it.
6. Write a swap function, that swaps the values of two variables in main, but usepointers instead of reference parameters.7. Write a function that takes an array of ints and its size as arguments. It shouldcreate a new array that is the same size as the argument. It should set the values inthe new array by adding 10 to each element in the original array. The functionshould return a pointer to the new array. (Make sure you use dynamic memoryallocation) can i get answers for this two sub parts. thanks
13.12 LAB: Merge sort The class is the same as shown at the end of the Merge sort section, with the following changes: Numbers are entered by a user in a separate helper method, readNums(), instead of defining a specific array in main(). The first number is how many integers to be sorted, and the rest are the integers. Output of the array has been moved to the method printNums(). An output has been added to mergeSort(), showing the indices that will be passed to the recursive method calls. Add code to the merge sort algorithm to count the number of comparisons performed. Add code at the end of main() that outputs "comparisons: " followed by the number of comparisons performed (Ex: "comparisons: 12") Hint: Use a static variable to count the comparisons. Note: Take special care to look at the output of each test to better understand the merge sort algorithm. Ex: When the input is: 6 3 2 1 5 9 8 the output is: unsorted: 3 2 1 5 9 8 0 2 | 3 5 0 1 | 2 2 0 0 | 1 1 3 4 | 5 5 3 3 | 4…
in c++ also please write comment to each line of the code explaining the code Suppose we have class named NumberList that holds a linked list of double values. In this section you will modify the class by adding recursive member functions. The functions will use recursion to traverse the linked list and perform the following operations: Count the number of nodes in the list. To count the number of nodes in the list by recursion, we introduce two new member functions: numNodes and countNodes. countNodes is a private member function that uses recursion, and numNodes is the public interface that calls it. Display the value of the list nodes in reverse order. To display the nodes in the list in reverse order, we introduce two new member functions: displayBackwards and showReverse. showReverse is a private member function that uses recursion, and displayBackwards is the public interface that calls it.
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
2.2.14 Combining sorted queues. Create a static function that accepts two sorted queues as parameters and returns a queue formed by merging the queues into sorted order. 2.2.15 Mergesort from the bottom of the queue. Create a bottom-up mergesort implementation using the following method: Create N queues, each containing one of the things, given N items. Make a queue out of the N queues. Then, repeat Exercise 2.2.14's merging process on the first two queues, and finally, reinsert the combined queue.Repeat until there is just one queue in the queue of queues.
1. Write a C++ function named "extractDebugOption" that accepts arguments similar to argc (an integer for the array size) and argv (an array of pointers to C-string). It will determine whether it has the argument of "/debug yes" or "/debug no". It will return true if the debug option is yes. If "/debug no" or there is no debug option or "/debug" without "yes" or "no" followed, it will return false. Note: command line arguments are simply an array of pointers to C-string. Please test it with the following command line arguments These will return true"/debug yes""/compile /debug yes" These will return false"/debug no""/debug""debug""yes /debug""no /debug"