Explain the concept of entrepreneurship and discuss its importance for students

why should medical students study medical sociology?

assess post covid response in students across globe

In Java, write the method public static void insertUnique(List l, T e), user of the ADT List. The method takes a list l and an element e and inserts the element at the end of the list only if it is not already there. Example 0.2. If l : A → B → C, then after calling insertUnique(l, "C"), the list does not change. Calling insertUnique(l, "D") will make l be : A → B → C → D.

1. Consider the following program written in C syntax:

void swap(int a, int b) { int temp; temp = a; a = b; b = temp;}

void main() {

int value = 2, list[5] = {1, 3, 5, 7, 9};

swap(value, list[0]);

swap(list[0], list[1]);

swap(value, list[value]);

}

For each of the following parameter-passing methods, what are all of the values of the variables value and list after each of the three calls to swap?

1. Passed by value
2. Passed by reference
3. Passed by value-result

In python, write a function, called ThreeSum, that accepts a list of non-negative numbers as input, and returns the highest sum of three neighboring elements in it. Write a main method that initializes the following five lists, gets the ThreeSum result for all of them using the above function, and prints the result to the screen. Example of the output: List 1: [4,5,4,5] , Three sum = 14 List 2: [7] , Three sum = 7 List 3: [ ] , Three sum = 0 List 4: [8,1] , Three sum = 9 List 5: [1,3,5,7,4,2,9] , Three sum = 16

Exercises a - b refer to the recursive algorithm SelectionSort

(a.) In one part of algorithm SelectionSort, the index of the maximum item in a list must be found. This requires comparisons between list elements. In an n-element (unsorted) list, how many such comparisons are needed in the worst case to find the maximum element? How many such comparisons are needed in the average case?

(b.) Defining the basic operation as the comparison of list elements and ignoring the amount of work required to exchange list elements, write a recurrence relation for the amount of work done by selection sort on an n-element list.

Create a static method with the appropriate inputs and outputs. Call each of them in the main method.

Write a method called removeAllInstances() which takes in a List and item4 . The method then proceeds to remove each item in the list that matches the given item. For example, if the method is passed the List [1, 4, 5, 6, 5, 5, 2] and the Integer 5, the method removes all 5’s from the List. The List then becomes [1, 4, 6, 2]. It should return nothing, since the changes the List it was provided. 5

Please do this in Java.