Question
** Please help me out, I'm trying to study for my final and this question is a practice example to prepare myself for the final **
Note: there are four parts to this problem over this and the following two pages. Part B is to implement the finction described; but there are two shorter parts that come after that; you can do them in pretty much any order. Consider the C++ function remove KAtLoc remove k at loc") which removes the k elements starting at location loc in the given linked list. You may assume the location numbers start at 0, so for a list with 5 elements, removeKAtLoc (list, 2, 2), would remove the third and fourth elements in the list (i.e., the ones numbered 2 and 3); that is the first example shown below. Note: to make this problem simpler, you may assume that the never removes the first element in the list this is reflected in the precondition shown on the next page. It's legal to pass in a loc or k that would go off the end of the list: see examples below for behavior list before call loc k list after call to removeKAtLoc (list loc, k) (0 1 2 3 4) (0 1 4) (26 75) (25) (26 75) (2) (26 75) 43 (2) (26 75) (26 75) (2) (2) (26) (26) Come up with a thorough set of test cases for this function, as you would use for unit Part A testing. We don't want to see the exact values for the test cases. What is required is to describe the category of each test you would need to do. We'll give one such case here as an example (len refers to the length of the list): list with len 1, loc 1 and (len-1), k 1 and (len-loc)
Explanation / Answer
it print 1->2->3->1->2->3->1->2->3-> and so on. its a circular Link list
