For the scramble.c problem, write a program that: • Has a main () function and another function that has this prototype: void scramble_str(char s[]); • The scramble_str() function scrambles the contents of the string in a random way so that the string has the same length as before, but the contents are all mixed around. It does this in-place, i.e., there is only one buffer that holds a string. You're free to scramble it any way you want to, but use rand () repeatedly so it gets really scrambled. • The main () function will read a string entered by the user into the buffer, call scramble_str(), and output the resulting string. This will be done in a loop forever, until the entered string is the string "bye". When the user says "bye", the program will exit with a polite message. • Do note that reading a string using scanf (), which is the only tool I've introduced you to so far, will just read up to the first whitespace. So, multiple-word strings won't work! Let's use something that will read up to a newline character: gets (). See the supplemental note and an example below. • Make the buffer 50 characters big.

Question R   .Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

Complete the function that computes the length of a path that starts with the given Point. The Point structure = point on the plane that is a part of a path. The structure includes a pointer to the next point on the path, or nullptr if it's the last point.   I'm not sure how to fill in the '?'; especially the while loop I'm not sure how to implement the condition for that.

Write a c++ program that reads in input commands related to a queue with no more than ten elements and performs the specified operations. Note that you should create three files, one for the main, one for Queue.h, and one for Queue.cpp. Those commands are: 'E', which will be followed by a number. You should enqueue that number 'D', which will dequeue the value from the front of the queue and print it, followed by a new line 'K'. which will peek at the value at the front of the queue and print it, followed by a new line 'Q', which will quit the program You can assume that all the input is valid.

Student should be able to develop the programs for stack using arrays and linked list By using C++ software Write a C++ program that reads a data file consisting of each student's GPA followed by the student's name. The program then prints the highest GPA and the names of all the students who received that GPA. The program scans the input file only once. Moreover, we assume that there are a maximum of 100 students in the class. INPUT The program reads an input file consisting of each student's GPA, followed by the Student's name. Sample data is as follows: 3.5 Baharom 3,6 Jason 2.7 Lisa 3.9 Khadijah 3.4 Jamal 3.9 Davendren 3.4 Termizi OUTPUT The program outputs the highest GPA and all the names associated with the highest GPA. For example, for the preceding data, the highest GPA is 3.9 and the students with that GPA are Khadijah and Davendren.

C++ Code dynamicarray.h and dynamicarray.cpp

C++ LANGUAGE In this assignment, you will be writing two objects to heuristically compare the performance of the bubble sort, selection sort, and insertion sort algorithms. To do this, a “Timer” object will be created and compositionally related to a storage class that will load the file contents, execute the sorts in an unbiased manner, handle any memory allocations that need to be made in order to do this, and reports back the execution times of each algorithm on the provided input files for that machine. First you will need to make a Timer object. This object should function like a traditional stopwatch with methods for starting, stopping, resetting, and reporting back times. The design of the object itself is up to you (it should minimally contain methods for the aforementioned ideas), but it must consist of a solitary object that provides interfaces appropriate for being compositionally included as part of a sorting object to facilitate the timekeeping portion of this exercise.…

Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle}               When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…

in C++ answer the following question in the image :

Python decorators can be used in Django in order to avoid duplication of code in view functions. For instance, consider the following definition of a decorator that is then applied to a view function. This code has three bugs: 01: def fetch_author (view_func) : 02: 03: 04: 05: 06: 07: 08: def wrapper (request, *args, **kwargs) : return view_func 09: 10: @fetch_author 11: def books_new (request) : 12: 13: 14: 15: 16: 17: } books = Book.objects.filter (authors _in= [author], year_ _gte="2015") context = { try: author = Author.objects.get (id-request. GET ["author_id"]) view_func (request, author, *args, **kwargs) except Author. Does NotExist: return bad_request (request, Author.DoesNotExist) Line 02 Line 05 Line 08 return render (request, "books-recent.html", context) Line 11 Identify the three lines which contain the three bugs: Line 12 Line 17 "title" : "New books", "books" books,