NROB60H3 Chapter Notes -Trapezoid Body, Abducens Nerve, Mammillary Body

54 views6 pages

tealcaribou494

20 Nov 2010

School

Department

Course

Professor

For unlimited access to Textbook Notes, a Class+ subscription is required.

Document Summary

In the following dissection, ten coronal cuts will be made along the length of the brain. E, are referred to as rostral cerebral coronal dissections and these outline the head of caudate as well as the olfactory region. The following cuts, f and g, outline the middle cerebral coronal dissections and the thalamic nuclei as well as fimbria of hypothalamus emerge here. The caudal cerebral coronal dissections, h and i, consist of the geniculate bodies, substantia nigra, and the remaining structures of hippocampus. Lastly, the cerebellar cuts (j, k, and l) have a wide variety of structures unique to each cut. These cuts are best performed with two people in general; however the cerebellar cuts should be performed by one person to avoid any close encounters with fingers and knives. N scalpel (for finer incisions, separations, and excision of meninges unattended during first lab)

Related Questions

33. Base10 is the set of numbers created from the digits {0,1,2,3,4,5,6,7,8,9}. Whereas base2, which is the set of numbers created with {0,1}. We could similarly define base; as the ordered set of characters created from {X,Y,Z}. What is the following basez number, Yxz, in base ? Random graph For this section you will need to look at the classes Graph and GraphNode present in the appendix. A Graph consists of a number of nodes, each of which has connections to other nodes in the graph. You can think of nodes as a representation of a person in a social network (e.g. Facebook). The ArrayList connectedTo variable in GraphNodes is the list of friends that particular person has. For example, in the following graph, the node O is friends with node 1 and 2. On the other hand, node 2 and node 1 are not friends, hence the lack of link. 0-0 In the constructor of the Graph, the process of connecting nodes is randomized. Moreover, we will not allow a node to be connected to itself and we are going to assume that the arguments passed to the Graph constructor respect the following conditions: n > 2, and n > nbConnections. Pay close attention to the character order

7. Write a class MetroLine in which you define a new type MetroLine (10 points) A MetroLine is defined to have the following private properties: • A String representing the colour of the line (e.g. blue, red, green, etc. No numbers. It's Montreal, not Manhattan!) • A collection of MetroStation This collection can be either a built in array, an ArrayList, or any other kind of collection you feel would satisfy the requirements of the class. The collection must be able to define an ordering from "beginning" to "end" of the MetroLine. It does not matter which part you consider the beginning and which part is the "end" as long as it is consistent. (We recommend using ArrayList but you are free to do otherwise if you feel it will be casier.) A MetroLine should have the following methods defined: • A constructor which takes nothing as input and performs any initialization necessary to maintain your collection of stations. • A method addstation which takes as input a MetroStation and adds it to the end of your collection. The method can assume the station is not already part of the collection and should return void. Note that the order the MetroStations are added is the same as the path the trains will travel on (or it could be the reverse path as well). • A method hasStation which takes as input a MetroStation and returns a boolean representing whether the metro line has a MetroStation with the same name or not. A method get LineColour which returns the colour of the line. • A method get First Stop which returns the MetroStation representing the first stop of the metro line. If there is no such station (ic, if the collection of MetroStation is empty), your method should return null. • A method get PriorStop which takes as input a MetroStation and returns the stop prior to the MetroStation passed as input. You may assume that the MetroStation passed as input is indeed in the collection of MetroStations If the current station is the first stop on the MetroLine then this method should return null. You may assume that there are no "loops" in the MetroLine That is, no station is present on the same line twice. A method getNext Stop which takes as input a MetroStation and returns the stop after the MetroStation passed as input. You may assume that the Metrostation passed as input is indeed in the collection of Metrostations. If the current station is the last stop on the MetroLine, then this method should return null. You may assume that there are no "loops" in the MetroLine That is, no station is present on the same line twice. For the above methods, you may assume that there is no aliasing issue. That is to say, you can use == to compare the references, or if you are using a type such as ArrayList to maintain your list of stations, you can use the indexOf or contains method defined on an ArrayList.

You have been contracted by a popular fitness club to create a Java Program that
will help in the input, calculation, display of calories burnt and pounds lost during a week of
workout for members of the club.
The program will also base on the amount of weight lost update the weight of the user and
calculate and display the users BMI – body mass index using any researched method. See an
example here- http://www.whathealth.com/bmi/formula.html
The club takes part in 5 major types of activities, namely walking, running, swimming, hiking,
and bicycling.
The program is to prompt for the Name of the member, gender, weight in pounds, height and
the time spend on each activity during the week in minutes.
The program will then calculate the calories burnt per activity, the total calorie burnt for the
week and the amount of weight lost during the week.
The amount of weight loss will be used to update the weight that was stored in the array and
calculate the person BMI . http://www.whathealth.com/bmi/formula.html
Activity Calorie Burnt Per pound per minute for
men (women are 1/6 less)
Walking .036
Running .095
Swimming .058
Hiking .058
Bicycling .044
 Calories burned per pound per minute (Bicycling – .044) x (times) your exact weight
(140 pounds) = (equals) total calories burned per minute (6.16 calories burned per
minute) x(times)minutes of activity (30 minutes) = (equals) 184.80 total calories
burned per activity.
 Women burn 1/6 less calories than Men.
 3500 calories = 1 pound of weight loss.
Author: Dexter Chin-Yan
Write a program that would do the following:
 Print a suitable heading and prompt for the required information
 Calculate the necessary required information and store in an Array(s)
o After members names, gender, weight in pounds and time spent in each
activity has been entered (10 Members) The program should calculate the
total calories burnt Total Calorie Burnt for the week and the amount of
weight loss (depending on whether it is a man or a woman.
o Calculate and display BMI and weight status based on the table above.
General Guidelines:
 Make use of appropriate messages to make you program as informative and user
friendly as possible, without being unnecessarily complex.
 Keep user interactions simple and instructions clear
 Use adequate documentation and proper indentation to clarify your program code
where necessary and improve layout
 Pay attention to good structure and use of programming constructs.
Evaluation
 Documentation and layout (spacing, indentation and commenting) 10 marks
 Proper layout of interface for input, output of information 10 marks
 Use of method to calculate, BMI, calories burnt per activity, and weight loss.
20 marks
 Creation and use of arrays to hold and processed information 20 marks
 Working program (Correctness, efficiency, user interaction)

dove

NROB60H3 Chapter Notes -Trapezoid Body, Abducens Nerve, Mammillary Body

Document Summary

Get access

Related Documents

NROB60H3 Study Guide - Final Guide: Dentate Gyrus, Superior Cerebellar Peduncle, Cerebral Crus

NROB60H3 Chapter Notes - Chapter 7: Dorsal Root Ganglion, Dura Mater, Sagittal Plane

Anatomy and Cell Biology 3319 Lecture Notes - Lecture 6: Ideomotor Phenomenon, Ventral Anterior Nucleus, Prefrontal Cortex

Related Questions