True or False? If true, give a brief reason why; if false, give a counterexample. (Assume in all that V and W are vector spaces.)

a. If T : V → W is a linear transformation, then T(0) = 0.

b. Let V be a vector space with basis α = {v1, v2, . . . , vn}. Let S : V → W and T : V → W be linear transformations, and suppose for all vi ∈ α, S(vi) = T(vi). Then S = T, that is, for all v ∈ V , S(v) = T(v).

c. Every linear transformation from R3 to R3 has an inverse. That is, if T : R3 → R3 is a linear transformation, then there exists a linear transformation S : R3 → R3 such that S(T(v)) = T(S(v)) = v for all v ∈ R3 .

d. If T : Rn → Rm is a linear transformation and n > m, then Ker(T) 6= {0}.

e. If T : V → W is a linear transformation, and {{v1, v2, . . . , vn} is a basis of V , then {{T(v1), T(v2), . . . , T(vn)} is a basis of W.

B.F., age 28, presents with diarrhea and abdominal pain. He says he feels weak and feverish. His symptoms have persisted for 5 days. He tells you he has 8 to 10 bowel movements each day, although the volume of stool is only about “half a cupful.” Each stool is watery and contains bright-red blood. Before this episode, he had noticed a gradual increase in the frequency of his bowel movements, which he attributed to a new vitamin regimen. He has not traveled anywhere in the past 4 months and has taken no antibiotics recently. His medical history is significant for UC; his most recent exacerbation was 2 years ago. He is taking no medications except vitamins.

Examination findings include a tender, slightly distended abdomen. His BP is 122/84 sitting, 110/78 standing; HR 96 bpm; and temperature of 100°F. Otherwise, physical findings are unremarkable. Laboratory study results reveal hemoglobin 12 g/dL; hematocrit 38%; white blood cell count 12,000/mm³; platelet count 242k; sodium 132; potassium 3.6. All other study results are within normal limits. The most recent colonoscopy findings (4 years ago) revealed granular, edematous, friable mucosa with continuous ulcerations extending throughout the descending colon.

1. List the specific goals for treatment for B.F.
2. What drug therapy would you prescribe? Why?
3. What are the parameters for monitoring the success of the therapy?
4. Discuss specific patient education based on the prescribed therapy.
5. List one or two adverse reactions for the selected agent that would cause you to change therapy.
6. What would be the choice for second-line therapy?
7. What over-the-counter and/or alternative therapies might be appropriate for B.F.?
8. What lifestyle changes would you recommend for B.F.?
9. Describe one or two drug-drug or drug-food interactions for the selected agent

Write your prescription for this patient.

Hello,

***We have to print the second list backward while interleaved with the first list in normal order.***

its PYTHON language.

Please refer the below example. Bold are the inputs that the user enters. In here the user input words and much as he wants and when he enter STOP, it stops and he is asked to enter more words.(second words count equals to the word count he inputs in the first phase)

Enter words, STOP to stop. Ok

Enter words, STOP to stop. we're

Enter words, STOP to stop. this

Enter words, STOP to stop. STOP

Ok. Now enter 3 other words.

Word 0: again?

Word 1: doing

Word 2: wait

Now I will magically weave them more weirdly!

Ok

wait

we're

doing

this

again?

PS : I have done it actually but the I have a problem getting the last output.(how to merge the 2 lists.) It only prints the words in input order.

MY CODE :

firstlist = []
c=0
stop = False

while not stop:
    a = input("Enter words, STOP to stop. : ")
    if a == "STOP":
        stop = True
    else:
        c+=1
        firstlist.append(a)


print("Okay. Now enter other " + str(c) +" numbers!")

for i in range(c):
    v = input('Enter word ' + str(i+1) + ': ' )
    firstlist.append(v)

print("I'm going to magically weave the words!!")

for x in firstlist:
    print(x)

Please help.

i need to find complexity and cost and runtime for each line of the following c++ code :

// A C++ program for Dijkstra's single source shortest path algorithm.
// The program is for adjacency matrix representation of the graph

#include <limits.h>
#include <stdio.h>

// Number of vertices in the graph
#define V 9

// A utility function to find the vertex with minimum distance value, from
// the set of vertices not yet included in shortest path tree
int minDistance(int dist[], bool sptSet[])
{
   // Initialize min value
   int min = INT_MAX, min_index;

   for (int v = 0; v < V; v++)
       if (sptSet[v] == false && dist[v] <= min)
           min = dist[v], min_index = v;

   return min_index;
}

// A utility function to print the constructed distance array
void printSolution(int dist[])
{
   printf("Vertex \t\t Distance from Source\n");
   for (int i = 0; i < V; i++)
       printf("%d \t\t %d\n", i, dist[i]);
}

// Function that implements Dijkstra's single source shortest path algorithm
// for a graph represented using adjacency matrix representation
void dijkstra(int graph[V][V], int src)
{
   int dist[V]; // The output array. dist[i] will hold the shortest
   // distance from src to i

   bool sptSet[V]; // sptSet[i] will be true if vertex i is included in shortest
   // path tree or shortest distance from src to i is finalized

   // Initialize all distances as INFINITE and stpSet[] as false
   for (int i = 0; i < V; i++)
       dist[i] = INT_MAX, sptSet[i] = false;

   // Distance of source vertex from itself is always 0
   dist[src] = 0;

   // Find shortest path for all vertices
   for (int count = 0; count < V - 1; count++) {
       // Pick the minimum distance vertex from the set of vertices not
       // yet processed. u is always equal to src in the first iteration.
       int u = minDistance(dist, sptSet);

       // Mark the picked vertex as processed
       sptSet[u] = true;

       // Update dist value of the adjacent vertices of the picked vertex.
       for (int v = 0; v < V; v++)

           // Update dist[v] only if is not in sptSet, there is an edge from
           // u to v, and total weight of path from src to v through u is
           // smaller than current value of dist[v]
           if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX
               && dist[u] + graph[u][v] < dist[v])
               dist[v] = dist[u] + graph[u][v];
   }

   // print the constructed distance array
   printSolution(dist);
}

1. Show clearly, with calculation steps, how to make 200ml of 90% and 80%(v/v) ethanol, respectively.
2. Show clearly, with calculation steps, how to make 70% (v/v) ethanol + 1% (v/v) acetic acid (final volume = 200ml).

Mass M moves to the right with speed =v along a frictionless horizontal surface and crashes into an equal mass M initially at rest. Upon colliding, the two masses stick together and move with speed V to the right. Notice that v and V denote different speeds.  After the collision the magnitude of the momentum of the system is:

(pick all correct answers)

2 M V

M V

0

2 M v

M v

Using Extrinsic and Intrinsic Rewards to Motivate Student Achievement

Objectives

• To identify extrinsic and intrinsic rewards that motivate student achievement.
• To generate suggestions for how instructors can use extrinsic and intrinsic rewards to motivate student achievement.

Introduction

The purpose of this exercise is to explore the use of rewards in motivating student achievement. There are two types of rewards—extrinsic and intrinsic—that can be used to fuel student motivation. Extrinsic motivation drives people’s behavior when they do things in order to attain a specific outcome. Extrinsic motivation is the payoff a person receives from others for performing a particular task. For students, these rewards include things like grades, getting better jobs, verbal recognition from peers and professors, academic scholarships, and admittance to honorary societies and associations. In contrast, intrinsic motivation is driven by positive feelings associated with doing well on a task or job. Intrinsic rewards are self-granted; the payoff comes from pleasing yourself.

Instructions

1. Individually brainstorm a list of extrinsic and intrinsic rewards that are associated with academic achievement.
2. As a group create a master list of all unique ideas generated through brainstorming. As a group, identify the top five extrinsic and intrinsic rewards from the list. The group can use a voting procedure to arrive at consensus.
3. Generate specific recommendations for how any college instructor might build these top five extrinsic and intrinsic rewards into a classroom environment.

Questions for Discussion

1. What did you learn about the use of rewards from this exercise?
2. How can instructors improve student achievement through the application of extrinsic and intrinsic rewards?
3. Can instructors really motivate students?

1. Which of the following is notone of the main features of Beethoven’s “symphonic ideal” as evidenced in his Fifth Symphony?
   1. Motivic drive
   2. Rhythmic consistency
   3. Psychological progression
   4. Strict adherence to form and classical musical ideals

1. Which of the following statements about Beethoven is false?
   1. Beethoven’s music enjoyed wild popularity during his lifetime but then was largely forgotten until the 20^thcentury.
   2. Beethoven’s work bridges the Classical and Romantic styles.
   3. For many, Beethoven’s works represent the ideal artist who strove to create works that showed personal elements as well as trying to elevate art in society.
   4. Beethoven lived and worked in a time when musicians and their music was being taken more seriously than ever before.

QUESTION 1

1. ___________ is a way to pay for the raw infrastructure, which the cloud operator oversees on your behalf.

   		IaaS
   		PaaS
   		SaaS
   		FaaS

1 points   

QUESTION 2

1. ____________ is a function within IT systems that bridges the gap between development and operations of systems.

   		CI
   		CD
   		DevOps
   		Agile

1 points   

QUESTION 3

1. There are many different versions of cloud _________, and not all clouds are created equal.

   		names
   		idiosyncrasies
   		locations
   		architecture

1 points   

QUESTION 4

1. Amazon’s serverless technology is called_________ ; Google and Microsoft call theirs Google Functions and Azure Functions, respectively.

   		Lambda
   		Delta
   		Alpha
   		Theta

1 points   

QUESTION 5

1. ________ cloud is a reference to on-premises deployment models.

   		public
   		private
   		local
   		hybrid

Determine, for a given graph G =V,E and a positive integer m ≤ |V |, whether G contains a clique of size m or more. (A clique of size k in a graph is its complete subgraph of k vertices.)

Determine, for a given graph G = V,E and a positive integer m ≤ |V |, whether there is a vertex cover of size m or less for G. (A vertex cover of size k for a graph G = V,E is a subset V⊆ V such that |V| = k and, for each edge (u, v) ∈ E, at least one of u and v belongs to V.)

a.)Describe the process of showing that a problem is NP complete

b.) given that the CLIQUE problem is NP complete. show that the VERTEX COVER problem is NP complete.