list some characteristics of life you observed by the water bear: list some observations about the water bear and why its apparently so successful in a variety of environments
In: Biology
python3:
Given a list of numbers in order order, return a new list sorted in non-decreasing order, and leave the original list unchanged.
function only
def mergeSort(inputArray):
#code here
a = [3,4,6,1,21,11,9,8]
b = mergeSort(a)
print('original array is: ', a)
print('sorted array is: ', b)
In: Computer Science
Task 4: Tuples
In: Computer Science
1. List tax -deductible expenditures and the deductible amount
2. Below the list of deductible expenses , re-configure your taxes and net income : Subtract your deductible expenses from your gross income to determine your Gross Income (AGI ). Then recalculate your taxes based on the AGI.
3. Subtract your taxes from your Gross Income to determine your updated net income .
Please use formulas for your calculations Tax calculations should be listed for each type of tax
no more info provided
In: Accounting
List and describe the four permitted Business Level Strategies? List and describe why the instructor has prohibited the use of the fifth Business Level Strategy
In: Operations Management
Complete the following methods:
secondlargest(): returns the second largest in the list without
sorting. Assumes list
has at least 2 elements.
palindrome(): checks if list elements are palindrome, i.e. list
elements from left to
right and right to left, are identical.
Code:
import java.util.*;
import java.io.*;
public class xxxxxL1 {
// class Variables
private int n, count, arr[];
PrintStream prt = System.out;
// xxxxxL1 Constructor
xxxxxL1(int k){
count = 0;
n = k;
// Allocate Space for
array
arr = new int[n+1];// index 0 is not
used
prt.printf("\tCreating array of size
%2d:",n);
} // end constructor
//prints list formatted 10 elements per line.
private void printlist(){
int i;
prt.print("\n\tList
contents:\n\t");
for (i = 1; i <= count;
i++){
prt.printf("%2d, ", arr[i]);
if (i % 10 == 0)
prt.printf("\n\t");
}
} // end printlist
// Return second largest in the list.
// Assume list has 2 or more elements.
private int secondlargest(){
return 0;
} // end secondlargest
// deletes x from list, if exist.
private int delete(int x){
int i, j;
if (count == 0)
return 0; //
invalid position
//shift array elements from position p to right
for (i = 1 ; i <= count ; i++)
if (arr[i] == x){
for (j = i ; j < count ;
j++)
arr[j] = arr[j+1];
count--;
return 1;
}
return 1;
} //end delete
//checks if list elements are palindrome, i.e.
//list elements from left to right and right to
//left, are identical.
private int palindrome(){
return 0;
} // end palindrome
//insert x at position p, in list
//for successful insertion: list should not be
// full(count=n) and 1 <= p <= count+1
private int insert(int x, int p){
int i;
if (count == n || p < 1 || p >
count+1)
return 0; //
invalid position
//shift array elements from position p to right
for (i = count ; i >= p ; i--)
arr[i+1] = arr[i];
// end for
arr[p] = x; // insert x at position
p
count++; // increment no. of
elements.
return 1; // successful insertion
} // end insert
public static void main(String args[]) throws
Exception{
int j, m, k, p, s, x;
try{
// open input file
Scanner inf = new
Scanner(System.in);
// read list size
k = inf.nextInt();
// Create a List of type Integer of
size k
xxxxxL1 lst = new
xxxxxL1(k);
//read no. of elements to
insert
m = inf.nextInt();
//Insert m elements in the
list
for(j = 1; j <= m;
j++){
x =
inf.nextInt(); // read x
p =
inf.nextInt(); // read position
//insert x at position
p
s = lst.insert(x,
p);
//if (s ==
1)System.out.printf(" Successful insertion.");
//else
System.out.printf(" Can not
insert.");
} // end for
//prints list formatted 10 elements
per line.
lst.printlist();
//print second largest
//p = lst.secondlargest();
//System.out.printf("\n\t2nd largest = %d.", p);
//read no. of elements to
delete from list
k = inf.nextInt();
//Delete k elements from the
lis
for(j = 1; j <= k;
j++){
x =
inf.nextInt(); // read next int
p =
lst.delete(x); //delete x
//if (p ==1)
System.out.printf(": deleted.");
//else
System.out.printf(": not found.");
}// end for
//prints list formatted 10
elements per line.
lst.printlist();
// close input file
inf.close();
} catch (Exception e) {
System.out.print("\nException
" + e + "\n");}
} // end main
} // end class xxxxxL1
In: Computer Science
Create a generic Linked List that does NOT use the Java library linked list. Make sure it contains or access a subclass named Node (also Generic). And has the methods: addFirst(), addLast(), add(), removeFirst(), removeLast() and getHead(). In a separate Java class provide a main that creates an instance of your LinkedList class that creates an instance of your LinkedList that contains String types. Add the five names (you pick them) to the list and then iterate through the list to print all the names.
In: Computer Science
In: Civil Engineering
List and discuss the metabolic diversity of microorganisms. Ex: Chemoheterotrophs (USLO 3.1)
List and describe organic molecules important in metabolism. (USLO 3.2)
In: Biology
21. List at least 10 functions that exterior building cladding performs and list one or two ways in which each of these functions is typically satisfied in a cladding design. Answer:
a. _______________________ ; ______________________________________________________
b. _______________________ ; ______________________________________________________
c. _______________________ ; ______________________________________________________
d. _______________________ ; ______________________________________________________
e. _______________________ ; ______________________________________________________
f. _______________________ ; ______________________________________________________
g. _______________________ ; ______________________________________________________
h. _______________________ ; ______________________________________________________
i. _______________________ ; ______________________________________________________
j. _______________________ ; ______________________________________________________
In: Civil Engineering