9 Pages

HRI 101 Exam One Review

Course: AESHM HRI 101, Fall 2007
School: Iowa State
Rating:
 
 
 
 
 

Word Count: 939

Document Preview

101 HRI Exam One Review Chapter 2: Unique components of hospitality Product not tangible Inseparability Perishability (food in restaurants) Capacity constrained business: Hotels and restaurants only have so much space. Try to shift demands to time when business is low. Service: Meeting customers' needs Keys to Success 1. 2. 3. 4. 5. Don't forget who you are Encourage every employee to act like a manager Handle...

Register Now

Unformatted Document Excerpt

Coursehero >> Iowa >> Iowa State >> AESHM HRI 101

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
101 HRI Exam One Review Chapter 2: Unique components of hospitality Product not tangible Inseparability Perishability (food in restaurants) Capacity constrained business: Hotels and restaurants only have so much space. Try to shift demands to time when business is low. Service: Meeting customers' needs Keys to Success 1. 2. 3. 4. 5. Don't forget who you are Encourage every employee to act like a manager Handle moments of truth Hire good people and keep them happy, hire for attitude over skill set. Guest loyalty 7 Deadly Sins of Service: 1. 2. 3. 4. 5. 6. 7. Apathy: forgetting you are there to provide a service Brush-off: ignoring customers because you are too busy Coldness: Condescension: Robotics: all employees have the same canned response Rule book: Runaround: The Disney Example: "We create happiness" Customers are referred to as guests Employees are cast members One day orientation called welcome to show business Every job is important Disney's 4 Basic Service Priorities: Safety Show Courtesy efficiency Chapter 4: Industry Associations: The National Restaurant Association: The NRA sends out periodicals monthly to keep their members informed. They also have and annual trade show in Chicago in May. This is the largest restaurant show in the country; it allows industry people to network. Associations in the hospitality field may be organized on several different levels. Associations may be created to meet the needs of individuals, businesses or organizations of one specific area. States have hospitality and tourism associations that serve the needs of members on a statewide level. Large national associations sometimes include colleges and universities affiliated with industry partners. International associations have members from around the world, and their members are often smaller industry associations. Industry associations will have a mission-a statement of purpose-that describes why the association was formed. You should be able to look at an association's mission statement and understand the purpose and scope of the organization. The mission statement is developed by the association's members or governing board and often serves as the guide for activities. Industry associations will also have bylaws that govern the membership and any paid staff that may be employed. Bylaws are rules or laws that govern the association's actions and internal operations. With the member's approval, bylaws may be amended or changed to meet new needs. Industry associations will also have a vision statement that serves as an umbrella statement about where the association sees itself in relation to the entire industry. Vision statements tend to be broader in scope than mission statement. They may also include goals that the association hopes to achieve in the future. Governing documents help to ensure the smooth running of all industry associations. Why join an industry association? Because networking is important. You need to meet people, exchange business cards and get to know them. Follow up, e-mail them a week later telling them how nice it was to meet them and that you would love to learn more about their company. Call them and set up an appointment to talk, afterward send them another e-mail thanking them for their time. Networking is building relationships. Industry Rating Services: Set standards definite with criteria. No government rating systems in the U.S. Goal is to provide an indicator of excellence in hospitality. Evaluated based upon a set of guidelines, one, two, and here diamond restaurants. American Automobile Association: Up to 5 diamonds Only 150 restaurants have a 5 diamond rating Mobil Travel Guide: Stars, 6 point tool For lodging and restaurants Chapter 6: Business Owners: Independent Owner One unit, maybe two Operate with a limited scope, smaller scale Stay with a successful approach Entrepreneur Entrepreneurial Recipe 1. Discovering the Business Opportunity Idea not currently available Recognize opportunity 2. Develop a business plan Well organized, written document Define goals and strengths 3. Securing required resources Personal money 4. Managing a new business venture Rewards vs. Risks Risks: Financial Career Personal: time, away from family and friends Psychological: stress Rewards: Financial Satisfaction: knowing you accomplished something Status: community will look at you in a better light Independence: no boss Control, over your schedule (per day, week, month) Why businesses fail: Not enough experience Unrealistic business plan Unrealistic goals High costs Operating procedures: lack of creativity Poor location: can people find you Lack of management ability Lack of funds: money runs out Chapter 7: Consistency Systems and procedures- in writing Reputations and image Dependent on employee training, same consistent concepts Performance and standards Measuring tools: know what is expected Facilitate decision making: in line with where we want to go Chain Operations Site selection Capital: greater access Purchasing economics: larger number, lower cost Marketing growth Branding, co-branding Branding: Used to attract and retain customers Associate two names/ symbols together Co-branding Enhance revenue/ market share: hotel using brand name shampoo Five reasons: o Finances: create benefits o Greater value: customer perception o Image: improves o Competitive position o Operational value: advantages Complimentary products Forming alliances Reputation and recognition Chapter 8: Two types of franchises Product or trade name: auto industry and soft drink companies Business format: ongoing business relationship includes products and service, majority of growth has been here. Advantages of the Franchisee: Site selection Credit Construction Training Economics of scale Ongoing support Disadvantages of the Franchisee: Restrictions Unwanted products Unwanted advertising Unprotected territories Advantages of the Franchisor: Expansion Income Ideas/ innovations Disadvantages of the Franchisor: Continually monitor standards Top 3 Franchise Hotels: Wyndham worldwide Choice hotels international Intercontinental Hotel Co. Chapter 9 Chapter 10 Contract Management Noncommercial: Organizations business is not food, ISU's is education "Captive audience" I.e.: schools, military, hospitals, etc. Two Options: Self-operation Organization employees Contact Management For profit business Hire-out Contract Management 8 Steps: 1. 2. 3. 4. 5. 6. 7. 8. Determine need to analyze foodservice alternatives Analyze foodservice Determine specific requirements Develop RFP, request for proposal Analyze proposal Negotiate contract Enter into contract Administer contract Chapter 11
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Iowa State - COM S - Comsci 103
Dr. Shu-Hui Chang Computer Science 103 BiometricsBiometrics is the technology of authenticating a person's identity by verifying a personal characteristic. Biometric devices grant users access to programs, systems, or rooms by analyzing some biomet
Penn State - ECON - 002
Penn State - ECON - 002
Iowa State - EM - 274
EM 274HW 1S 2002EM 274HW 1S 2002EM 274HW 1S 2002
Iowa State - EM - 274
EM 2742-37HW 2 TI 89 & 92+S 20022-392-41EM 2742-65HW 2 TI 89 & 92+S 20022-772-86
Iowa State - EM - 274
EM 274HW Week 2F2001Week 3 - AnswersTI 89 & 92+TI 89 & 92+
Wisconsin - ECON - 330
Chapter 9 Principles of Bank Management1. Liquidity Management2. Asset Management Manage credit risk - get borrowers with low default risk, paying high interest rates Buy securities with high return, low risk Diversify Manage interest-rat
Wisconsin - ECON - 330
Chapter 13: Multiple Deposit Creation Four Players in the Money Supply Process1. Central bank: the Fed 2. Banks 3. Depositors 4. Borrowers from banks Federal Reserve System 1. Conducts monetary policy 2. Clears checks 3. Regulates banksThe Fed's B
Wisconsin - ECON - 330
Managing Interest-Rate RiskInterest Rate RiskInterest rate risk is the potential impact of interest rate movements on an institution's net interest income and capital level. It focuses on the repricing speed of the institution's assets relative to
Wisconsin - ECON - 330
Chapter 14: Determinants of the Money SupplyMoney Multiplier, m reflects the effects on the money supply, MS of other factors besides the monetary base.MS = mMBMoney = Multiplier * Monetary BaseDefinitions:D = checkable deposits C = desir
Iowa State - EM - 274
EM 274HW Week 3F2001EM 274HW Week 3F2001EM 274HW Week 3F2001Week 4 - AnswersTI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+
Iowa State - EM - 274
EM 274Exam 1F 2001Thursday, Sept. 27, 8:00 10:00 P.M. Covered: Periods 1 through 11 Closed book and closed notes One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hilliard, Wen, Porumamilla Section
Iowa State - EM - 274
EM 274Exam 2F 2001Thursday, Nov. 1, 8:00 10:00 P.M. Covered: Periods 12 through 26 Closed book except for inside back cover and closed notes One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hillia
Iowa State - EM - 274
EM 274HW Week 8F2001EM 274HW Week 8F2001Week 9 - AnswersTI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+
Iowa State - EM - 274
EM 274HW Week 7F2001Week 8 - AnswersTI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+
Iowa State - EM - 274
EM 274HW Week 6F2001Week 7 - AnswersTI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+
Iowa State - EM - 274
EM 274Exam 1F 2001Thursday, Sept. 27, 8:00 10:00 P.M. Covered: Periods 1 through 11 Closed book and closed notes One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hilliard, Wen, Porumamilla Section
Iowa State - EM - 274
EM 274Final ExamF 2002Wednesday, December 18 4:30 6:30 P.M. Comprehensive Closed book and closed notes. One reference sheet allowed and you can write on both sides. Sections 4,6,7,9,10, H Hilliard, Sobti Sections 3, 5, 8, 12 Wen, Porumamilla 1
Iowa State - EM - 274
EM 274Final ExamF 2001Thursday, December 20 4:30 6:30 P.M. Comprehensive Closed book and closed notes. One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 0005 Physics Hilliard, Wen, Porumamilla Sections 5, 6 Ro
Iowa State - EM - 274
EM 274Exam 3F 2001Thursday, Dec. 6, 8:00 10:00 P.M. Covered: Periods 27 through 38 Closed book and closed notes. One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hilliard, Wen, Porumamilla Section
Iowa State - EM - 274
EM 274Exam 3F 2001Thursday, Dec. 6, 8:00 10:00 P.M. Covered: Periods 27 through 38 Closed book and closed notes. One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hilliard, Wen, Porumamilla Section
Iowa State - EM - 274
EM 274HW Week 11F2001EM 274HW Week 11F2001EM 274HW Week 11F2001Week 12 - AnswersTI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+TI 89 & 92+
Iowa State - EM - 274
EM 274Exam 2F 2001Thursday, Nov. 1, 8:00 10:00 P.M. Covered: Periods 12 through 26 Closed book except for inside back cover and closed notes One reference sheet allowed and you can write on both sides. Sections 1, 2, 3, 8, H 1002 Gilman Hillia
Iowa State - EM - 274
Law of Cosines:If: (draw in)2Moment about a line: 1.)c a b 2ab cos A B cos1 AB2 2M b ra fb2.) Must find Fxy first to find fx and fy correctly. Moments: M=Fd M=R x F (about a point in 3D) Right hand rule for +or-M b elinebc M b
Wisconsin - CS - 367
2-3 TreesPage 1 of 62-3 TREESContentsIntroduction Test Yourself #1 2-3 Tree Operations lookup insert Test Yourself #2 delete Test Yourself #3 2-3 Tree Summary Summary of Binary-Search Trees vs 2-3 TreesIntroductionRecall that, for binary-se
Wisconsin - ZOO - 101
Excretion and osmoregulationDisposal of metabolic wastes The control of the gain and loss of water and dissolved solutes1.Osmoconformers 2.Freshwater Osmoregulation 3.Saltwater Osmoregulation 4.Terrestrial OsmoregulationSome animals don't need t
Wisconsin - ZOO - 101
Extreme Cardiovascular Systems: Animals at High AltitudesChallenge: Obtaining sufficient O2 at low atmospheric pressuresSolutions:Large heart and lungs Many red blood cells (RBCs) RBCs have high [hemoglobin] Hemoglobin has high affinity for O2h
Wisconsin - ZOO - 101
ANSWER KEY, SAMPLE EXAM 2, ZOOLOGY 101 Spring 2008 Keep the following in mind in using this exam. These are exam questions from Spring 2007 when Dr. Thoma last taught this material in 101. She did not cover all of the same topics as she is covering t
Wisconsin - ZOO - 101
SAMPLE EXAM 1, ZOOLOGY 101 Spring 2008 Keep the following in mind in using this exam. These are exam questions from Spring 2006 when Dr. Bleiweiss last taught 101. He did not cover all of the same topics as he is covering this semester and those that
Wisconsin - CS - 367
Wisconsin - MATH - 211
Wisconsin - MATH - 211
Wisconsin - MATH - 211
x d a q ` d a q ` i` q d p B E D A T P E D 9 F A 9 ui 8 8 ` i !9 !9 d a q ` i d a E S ! ! y ! f ! x d a d a q ` ` i C C 9 D i` q u d aa ui ! ! S E ! F A 9 8 9 F 9 B a u D 8 A 9 ! D D E u ` ` ` a d p B E D A T P f aa
Wisconsin - CS - 367
Introduction: Abstract Data TypesPage 1 of 2INTRODUCTION: ABSTRACT DATA TYPESContentsGood Programs Use Abstraction Abstract Data TypesGood Programs Use AbstractionWhat makes a program good? 1. it works (as specified!) 2. it is easy to under
Wisconsin - MATH - 211
The AVL Tree Rotations TutorialBy John Hargrove Version 1.0.1, Updated Mar-22-2007AbstractI wrote this document in an effort to cover what I consider to be a dark area of the AVL Tree concept. When presented with the task of writing an AVL tree c
Wisconsin - MATH - 211
Binary Search TreesPage 1 of 14BINARY SEARCH TREESContentsIntroduction Test Yourself #1 Implementing Binary Search Trees The lookup method The insert method Test Yourself #2 The delete method Test Yourself #3 SummaryIntroductionAn important
Wisconsin - MATH - 211
BST AnswersPage 1 of 2Answers to Self-Study QuestionsTest Yourself #1Question 1(1) A / \ B C / -3 5 / ant (2) 10 / / bat (3) cat \ rat / 5 \ 20 (4) 15 \ 22 \ 30Tree 1 is not a BST because B is greater than A, yet B is in the left subtree of
Wisconsin - MATH - 211
Complexity and Big-O NotationPage 1 of 10COMPLEXITY AND BIG-O NOTATIONContentsIntroduction Test Yourself #1 Test Yourself #2 Big-O Notation How to Determine Complexities Test Yourself #3 Test Yourself #4 Best-case and Average-case Complexity W
Wisconsin - MATH - 211
Wisconsin - CS - 302
The edit-compile-test cyclehandout for CS 302 by Will Benton (willb@cs) EDIT: A programmer writes source code (human-readable program text) in an editor.The edit-compile-test cycle is the process by which programmers iteratively remove errors from
Wisconsin - CS - 302
Wisconsin - CS - 302
sPart I 1. A 4. D 2. E 5. E 3. B 6. B Part II 1.7. D 8. B 9. B10. A 11. E 12. C13. C 14. D 15. E16. A 17. C 18. DTestFlow: x = 12 TestFlow: y = 34 display: b = 34 display: a = 12 confuse: a = 8 display: b = 8 display: a = 12 2. class Cone {
Wisconsin - CS - 302
Wisconsin - CS - 302
Part I 1. C 2. A 8. A 9. D Part II3. B 4. E 10. D5. A 6. B 11. B7. C 12. E13. E14. C1. Part a A) editor B) source code C) compiler D) byte code or class file E) interpreter or JVM Part b (many different answers possible) int x = "7"; Java
Wisconsin - CS - 367
ExceptionsPage 1 of 9EXCEPTIONSContentsError Handling Exceptions How to Catch Exceptions Checked and Unchecked Exceptions Exception Hierarchy Choices when calling a method that may throw an exception Test Yourself #1 How to Define and Throw Ex
Wisconsin - CS - 302
Exceptions AnswersPage 1 of 1Answers to Self-Study QuestionsTest Yourself #1What is printed for each of the four runs? 1. d caught Ex1 2. c caught Ex2 b caught Ex1 3. b caught Ex3 4. a caught Ex4 execution stops due to uncaught exception Ex1 th
Wisconsin - CS - 367
HashingPage 1 of 5HASHINGContentsIntroduction Test Yourself #1 Lookup, Insert, and Delete Choosing the Hashtable Size Choosing the Hash Function Test Yourself #2 SummaryIntroductionRecall that for a balanced tree (e.g., a 2-3 tree), the ins
Wisconsin - CS - 367
Answers to Self-Study Questions for HashingPage 1 of 1Answers to Self-Study Questions for HashingTest Yourself #1Here is the result of the hash function: Name George Amy Alan Sandy Sum of Characters 57 39 28 63 hash(name) 7 9 8 3and the hash
Wisconsin - CS - 367
Implementing Lists Using Linked-ListsPage 1 of 20IMPLEMENTING LISTS USING LINKED-LISTSContentsIntroduction Java Types Test Yourself #1 Intro to Linked Lists Test Yourself #2 Linked List Operations Adding a node Test Yourself #3 Removing a node
Wisconsin - CS - 367
Linked-list AnswersPage 1 of 5Answers to Self-Study QuestionsTest Yourself #1Test Yourself #2 Question 1: l.getNext().setData("cat"); Question 2: l.setNext(new Listnode<String>("rat", l.getNext(); Test Yourself #3 The list begins:and after t
Wisconsin - CS - 367
Introduction to TreesPage 1 of 6INTRODUCTION TO TREESContentsIntroduction: Trees and Binary Trees Representing Trees Test Yourself #1 Tree Traversals Test Yourself #2 Test Yourself #3 Answers to Self-Study QuestionsIntroductionLists, stacks
Wisconsin - CS - 302
Operator Precedence in the JavaTM Programming Languagehandout for CS 302 by Will Benton (willb@cs)Operator precedence defines the order in which various operators are evaluated. (In fact, you may remember "order of operations" from secondary schoo
Wisconsin - MATH - 211
Wisconsin - MATH - 211
Wisconsin - CS - 367
ListsPage 1 of 12LISTSContentsThe List ADT Test Yourself #1 Java Lists Test Yourself #2 Implementing Our Own List Class Implementing the add methods Test Yourself #3 Implementing the constructor Iterators What are they? How to implement them?
Wisconsin - CS - 367
List AnswersPage 1 of 1Answers to Self-Study QuestionsTest Yourself #2Question 1: for (int pos = 0; pos < 2 * k; pos += 2) { words.add(pos, words.get(pos); } Question 2: int pos = 0; while (pos < words.size() { String word = words.get(pos); if
Wisconsin - CS - 302
Logical operators and equivalenceshandout for CS 302 by Will Benton (willb@cs)Goals: This handout gives an overview of the basic logical connectives: their names, their symbols in logical notation, and the operators to express them in Java syntax.
Wisconsin - MATH - 211
Definitions, statements and proofs that may appear on the first midterm Math 221In addition to more computational problems, a few questions on the test may ask you to state a definition or theorem and there will likely be one question asking you to
Wisconsin - MATH - 211
Statements, definitions and proofs that may appear on the second midterm. Statements: 1. State the chain rule. 2. Define what is the inverse function and what is the condition for its existence. State the formula for the derivative of inverse functio
Wisconsin - MATH - 211
Math 221, Fall 2006, Lecture 7, Solutions to Midterm 2. Try to do first the problems that look simplest to you. You don't have to follow the order. Avoid spending too much time on one question with others not done yet. Good luck! 1. Define what is th
Wisconsin - MATH - 211
Math 221, Lecture 7, Fall 2006, Midterm 1. Try to do first the problems that look simplest to you. You don't have to follow the order. Avoid spending too much time on one question with others not done yet. Good luck! 1. (15) Consider the function f (