Blog

Standard disclaimer: use the algorithms from class, such as DFS, Explore, BFS, Dijkstra’s (using min-heaps), SCC, Kruskal’s, Prim’s etc., as a blackbox subroutine for your algorithm. If you attempt to modify one of these algorithms you will not receive full credit, even if it is correct. Make sure to explain your algorithm in words (no pseudocode!), explain the correctness of your design, and state and analyze its running time. Faster – and correct – solutions worth more credit. Design an algorithm to solve the following problem:Input: a connected, undirected, weighted graph G = (V,E), and a subset U of the vertices  .Output: a spanning tree of minimal weight in which the vertices of U are leaves (note that there might be other leaves in this tree as well).  

With the patient’s skull in the PA position and the OML and central ray perpendicular to the image receptor;    where will the resulting radiograph demonstrate the petrous pyramids?

Male guinea pigs can be differentiated from females by their longer anogenital distance.

Methods that help to reduce the production of scatter radiation in a body part include using: Compression Beam restriction use of a grid

The cumulative occupational exposure limit for a 29 year old radiographer is

Roman elites were known as

What type of equipment is indicated for use with volatile chemicals?

The Peloponnesian War was between: 

An exposure was made using 12 mAs and 60 kVp. If the kVp was changed to 69 in order to obtain longer scale contrast, what should be the new mAs to maintain exposure?

When calculating the required cage space for a dog, where should the dog be measured?