Friday, October 12, 2012

PRINCIPLES OF MANAGEMENT



  1. PRINCIPLES OF MANAGEMENT - MGT503
  2. Table of Contents
  3. Ch# Title Page
  4. 1 Historical overview of Management ……………………………………………………… 1
  5. 2 Management and Managers ………………………………………………………………. 5
  6. 3 Managerial Roles in Organizations ……………………………………………………….. 7
  7. 4 Managerial Functions i.e. POLCA ………………………………………………………... 9
  8. 5 Managerial Levels and Skills ……………………………………………………………… 11
  9. 6 Management Ideas: Yesterday and Today ………………………………………………... 14
  10. 7 Classical View of Management (Scientific and Bureaucratic)……………………………… 16
  11. 8 Administrative View of Management ……………………………………………………. 19
  12. 9 Behavioral Theories of Management 20
  13. 10 Quantitative, Contemporary and Emerging Views of Management ………………………. 23
  14. 11 System’s View of Management and Organization ………………………………………... 25
  15. 12 Analyzing Organizational Environment and Understanding Organizational Culture …….. 29
  16. 13 21st Century Management Trends………………………………………………………… 32
  17. 14 Understanding Global Environment: WTO and SAARC ………………………………… 36
  18. 15 Decision Making and Decision Taking …………………………………………………… 39
  19. 16 Rational Decision Making ………………………………………………………………... 41
  20. 17 Nature and Types of Managerial Decisions ……………………………………………… 43
  21. 18 Non Rational Decision Making ………………………………………………………….. 45
  22. 19 Group Decision Making and Creativity ………………………………………………….. 47
  23. 20 Planning and Decision Aids-I …………………………………………………………… 50
  24. 21 Planning and Decision Aids-II …………………………………………………………… 53
  25. 22 Planning: Functions & Benefits ………………………………………………………….. 56
  26. 23 Planning Process and Goals Levels ……………………………………………………… 59
  27. 24 Management by Objective (MBO) ………………………………………………………. 62
  28. 25 Strategic Management-I …………………………………………………………………. 65
  29. 26 Strategic Management-II ………………………………………………………………… 66
  30. 27 Levels of Strategies, Porter’s Model and Strategy Development (BCG) & Implementation.. 68
  31. 28 Entrepreneurship Management ………………………………………………………….. 73
  32. 29 Organizing ………………………………………………………………………………. 76
  33. 30 Job Design/Specialization and Departmentalization …………………………………….. 78
  34. 31 Span of Command, Centralization vs. Decentralization and Line vs. Staff Authority....…… 82
  35. 32 Organizational Design and Organic vs. Mechanistic vs. Virtual Structure………...……….. 85
  36. 33 Leading and Leadership Motivating Self and Others ……………………………………… 88
  37. 34 Maslow’s Needs Theory and its Analysis ………………………………………………… 90
  38. 35 Other Need and Cognitive Theories of Motivation ……………………………………… 91
  39. 36 Expectancy, Goal Setting and Re-Enforcement Theories ………………………………… 94
  40. 37 Motivating Knowledge Professionals Leadership Trait Theories ………………………… 96
  41. 38 Behavioral and Situational Models of Leadership ………………………………………… 98
  42. 39 Strategic Leadership Models ……………………………………………………………... 102
  43. 40 Understanding Group Dynamics in Organizations ……………………………………… 105
  44. 41 Group Concepts, Stages of Group Development and Team Effectiveness ……………… 107
  45. 42 Understanding Managerial Communication ……………………………………………… 112
  46. 43 Communication Networks and Channels Effect of ICT on Managerial Communication … 115
  47. 44 Controlling as a Management Function ………………………………………………….. 119
  48. 45 Controlling Organizational Performance through Productivity and Quality ……………… 124



Lecture No. 02
Reading Material
Data Structures and Algorithm Analysis in C++ Chapter. 3
3.1, 3.2, 3.2.1, 3.2.2
Summary
1) List Implementation
• add Method
• next Method
• remove Method
• find Method
• Other Methods
2) Analysis Of Array List
3) List Using Linked Memory
4) Linked List
Today, we will discuss the concept of list operations. You may have a fair idea of ‘ start operation’ that sets the current pointer to the first element of the list while the tail operation moves the current pointer to the last element of the list. In the previous lecture, we discussed the operation next that moves the current pointer one element forward. Similarly, there is the ‘back operation’ which moves the current pointer one element backward.
List Implementation
Now we will see what the implementation of the list is and how one can create a list in C++. After designing the interface for the list, it is advisable to know how to implement that interface. Suppose we want to create a list of integers. For this purpose, the methods of the list can be implemented with the use of an array inside. For example, the list of integers (2, 6, 8, 7, 1) can be represented in the following
12
CS301 – Data Structures
manner where the current position is 3.
A
2
6
8
7
1
current
size
1
2
3
4
5
3
5
In this case, we start the index of the array from 1 just for simplification against the usual practice in which the index of an array starts from zero in C++. It is not necessary to always start the indexing from zero. Sometimes, it is required to start the indexing from 1. For this, we leave the zeroth position and start using the array from index 1 that is actually the second position. Suppose we have to store the numbers from 1 to 6 in the array. We take an array of 7 elements and put the numbers from the index 1. Thus there is a correspondence between index and the numbers stored in it. This is not very useful. So, it does not justify the non-use of zeroth position of the array out-rightly. However for simplification purposes, it is good to use the index from 1.
add Method
Now we will talk about adding an element to the list. Suppose there is a call to add an element in the list i.e. add(9). As we said earlier that the current position is 3, so by adding the element 9 to the list, the new list will be (2, 6, 8, 9, 7, 1).
To add the new element (9) to the list at the current position, at first, we have to make space for this element. For this purpose, we shift every element on the right of 8 (the current position) to one place on the right. Thus after creating the space for new element at position 4, the array can be represented as

We have moved the current position to 4 while increasing the size to 6. The size shows that the elements in the list. Where as the size of the array is different that we have defined already to a fixed length, which may be 100, 200 or even greater.
next Method
Now let’s see another method, called ‘next’. We have talked that the next method moves the current position one position forward. In this method, we do not add a new element to the list but simply move the pointer one element ahead. This method is required while employing the list in our program and manipulating it according to the requirement. There is also an array to store the list in it. We also have two variables- current and size to store the position of current pointer and the number of elements in the list. By looking on the values of these variables, we can find the state of the list

Wednesday, October 10, 2012

At home online business essay work


SKYLARKPPV.COM


START UR ONLINEJOBS TODAY

EARN MONTHLY RS.7500 SPEND

JUST 15 MINT'S DAILY


Joining Fee R.s 4000 Life Time
You Can Earn daily $2.5 easly spend just 15 Mint's
if u join one user your downline u can get $2.77 free

Online Skylark job:

Daily 15 mint kam krna hai  Compny apko ads dy ge unpe click krne hote han jiasa k upar vedio me dekhya gaya ha
ads pe click karne  k 15 mints lgte hn bus Daily k $2.5  earning ho jate ha 13 din me he apke fee nikal aye ge
Registration ki Fee just R.s 4000 Ha maze ki bat k ye life time ke fee hai phli bar deni pare ge bus agar ap aik user ko join karwatte hian to apko $2.77 bonus mile ga isi tarha agar ap 20 log join karwate hian to apko
50*$2.77=$138 Milen ge
Pakistani R.s 13850 bante hian aur apki daily 15 mint work karne ka R.s7500 Monthly alag mile ga
Mean you are Monthly earning
R.s 13850+7500=21350
it's amaizing ury up and joing this fast if u join it so plz tell me
For More Information Contact Me
Contact 03226927277
City: Okara    Online job PTC Free

SKYLARK

SKYLARK COMPANY IS REALY ON LINE BUSSINES SITE
MANY PEOPLE ARE WORKING IN THIS ORGNIZATION
WE WISH HIM IN YOUR FUTURE