ALL UNIVERSITIES AND SERVICE COMMISSIONS PAST PAPERS IN PAKISTAN

Tuesday, June 25, 2013

Re: ::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

agr mily idea solution to kindly mujhe mail krna

On Tue, Jun 25, 2013 at 11:01 AM, habiba malik <habibamalik7@gmail.com> wrote:

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
Salam

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

kindly send me sta630 assignment idea solution

On Mon, Jun 24, 2013 at 8:59 PM, moon Kiani <kianimariyam@gmail.com> wrote:

kindly send me to the solution of this GDB

On Mon, Jun 24, 2013 at 7:05 AM, Muhammad Asif <itsvividmirror@gmail.com> wrote:

I think either a bst or avl tree will work fine for this scenario.

List of offenders should be loaded faster with the possibility to identify one as quickly as possible.

The trees can load the data faster because they preserve some order as compare to link list, queue or stack in which for each value we may need to find its right place and then rearrange whole thing. The other benefits of using tree is that the one offender can be found easily as we know that it takes nlog(n) to search in tree as compare to O(n) in link list, queue or stack.

Add/Remove Offenders:

The trees are faster to add data in them because we know that it will goes to its right place without the need of traversing the whole tree and usually requires nlog(n) to insert data. This is oppose to linked list, queue or stack in which we first have to search its right place and it can be worst to transverse whole data structure, so for them it can be O(1) but also O(n).

Deleting the offender from stack, queue and link list usually requires much time it can be O(1) if last but it can also be O(n) if it is first as compare to tree which is usually takes nlog(n).

Merging two offenders list:

The merging of two offenders list in linked list, stack and queue takes O(n + m) times where n & m are offender in two list. But in case of tree with appropriate use of algorithm it can O(n log n).

On Mon, Jun 24, 2013 at 10:11 AM, aspirant bibliophile <aspirant.bibliophile@gmail.com> wrote:

Question:

Suppose you are a game developer in a company and you have been given the task to develop a game which should fulfill all requirements mentioned below:

The game plots a bank robbery. Lots of people witness that robbery. Our game will load the lists of suspected offenders while the players (witnesses) will have to identify the offenders of this robbery. Game should load list of offenders to identify the one as quickly as possible. Admin can add/remove offenders in the lists and two or more lists of offenders can also be merged into one (to show it to the player).

As a game developer, which data structure you will use to develop the game? Justify your selection with solid arguments. Remember the most critical requirement is that the list should load super fast.

Note: A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.

Best of Luck!

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
Salam

Re: ::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

If you got solution then please me also....

Thanks

On Tue, Jun 25, 2013 at 11:01 AM, habiba malik <habibamalik7@gmail.com> wrote:

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

not enough..

On Mon, Jun 24, 2013 at 7:05 PM, Muhammad Asif <itsvividmirror@gmail.com> wrote:

I think either a bst or avl tree will work fine for this scenario.

List of offenders should be loaded faster with the possibility to identify one as quickly as possible.

The trees can load the data faster because they preserve some order as compare to link list, queue or stack in which for each value we may need to find its right place and then rearrange whole thing. The other benefits of using tree is that the one offender can be found easily as we know that it takes nlog(n) to search in tree as compare to O(n) in link list, queue or stack.

Add/Remove Offenders:

The trees are faster to add data in them because we know that it will goes to its right place without the need of traversing the whole tree and usually requires nlog(n) to insert data. This is oppose to linked list, queue or stack in which we first have to search its right place and it can be worst to transverse whole data structure, so for them it can be O(1) but also O(n).

Deleting the offender from stack, queue and link list usually requires much time it can be O(1) if last but it can also be O(n) if it is first as compare to tree which is usually takes nlog(n).

Merging two offenders list:

The merging of two offenders list in linked list, stack and queue takes O(n + m) times where n & m are offender in two list. But in case of tree with appropriate use of algorithm it can O(n log n).

On Mon, Jun 24, 2013 at 10:11 AM, aspirant bibliophile <aspirant.bibliophile@gmail.com> wrote:

Question:

Suppose you are a game developer in a company and you have been given the task to develop a game which should fulfill all requirements mentioned below:

The game plots a bank robbery. Lots of people witness that robbery. Our game will load the lists of suspected offenders while the players (witnesses) will have to identify the offenders of this robbery. Game should load list of offenders to identify the one as quickly as possible. Admin can add/remove offenders in the lists and two or more lists of offenders can also be merged into one (to show it to the player).

As a game developer, which data structure you will use to develop the game? Justify your selection with solid arguments. Remember the most critical requirement is that the list should load super fast.

Note: A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.

Best of Luck!

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

Monday, June 24, 2013

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

kindly send me to the solution of this GDB

On Mon, Jun 24, 2013 at 7:05 AM, Muhammad Asif <itsvividmirror@gmail.com> wrote:

I think either a bst or avl tree will work fine for this scenario.

List of offenders should be loaded faster with the possibility to identify one as quickly as possible.

The trees can load the data faster because they preserve some order as compare to link list, queue or stack in which for each value we may need to find its right place and then rearrange whole thing. The other benefits of using tree is that the one offender can be found easily as we know that it takes nlog(n) to search in tree as compare to O(n) in link list, queue or stack.

Add/Remove Offenders:

The trees are faster to add data in them because we know that it will goes to its right place without the need of traversing the whole tree and usually requires nlog(n) to insert data. This is oppose to linked list, queue or stack in which we first have to search its right place and it can be worst to transverse whole data structure, so for them it can be O(1) but also O(n).

Deleting the offender from stack, queue and link list usually requires much time it can be O(1) if last but it can also be O(n) if it is first as compare to tree which is usually takes nlog(n).

Merging two offenders list:

The merging of two offenders list in linked list, stack and queue takes O(n + m) times where n & m are offender in two list. But in case of tree with appropriate use of algorithm it can O(n log n).

On Mon, Jun 24, 2013 at 10:11 AM, aspirant bibliophile <aspirant.bibliophile@gmail.com> wrote:

Question:

Suppose you are a game developer in a company and you have been given the task to develop a game which should fulfill all requirements mentioned below:

The game plots a bank robbery. Lots of people witness that robbery. Our game will load the lists of suspected offenders while the players (witnesses) will have to identify the offenders of this robbery. Game should load list of offenders to identify the one as quickly as possible. Admin can add/remove offenders in the lists and two or more lists of offenders can also be merged into one (to show it to the player).

As a game developer, which data structure you will use to develop the game? Justify your selection with solid arguments. Remember the most critical requirement is that the list should load super fast.

Note: A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.

Best of Luck!

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

Re: ::: vuaskari.com ::: MBA Completion

Please any body who has completed mcs. please help me . I am facing problem in mcs . How i improve my CGP

On Mon, Jun 24, 2013 at 4:59 AM, Shoaib Asghar <dearshoaib@gmail.com> wrote:

I just read the msg from any1 who is doing MSBA. I am also studnt of it and facing difficulty. If Kishfeet khan want to do study for the subjects thn i m ready. My subjects are ECO704, FIN711,MGT704 AND MGT705.

On Mon, Apr 29, 2013 at 9:58 AM, Kishfeet Khan <kishfeet@gmail.com> wrote:

Need information regarding subjects to study in MSBA

On Monday, April 29, 2013, Kishfeet Khan wrote:

Jusy after clearing this four subjects you get your MSBA degree

On Thursday, April 18, 2013, Shoaib Asghar wrote:

I hav taken admission in MSBA. they offer me 4 subjects. but facing problem of lack of information by all sides.

On Sun, Apr 14, 2013 at 11:29 PM, ABDUL RAUF khokher <rauf.gz@gmail.com> wrote:

still not...

On Sat, Apr 13, 2013 at 8:33 PM, Shoaib Asghar <dearshoaib@gmail.com> wrote:

I hav collected my transcipt, character certificate, provisional certificate and english language certificate. Degree will be issued in July 2013. Now doing MSBA from VU.

On Tue, Apr 9, 2013 at 6:40 PM, mr. sam <pakio.redmoon40@gmail.com> wrote:

meraa veee

On Sun, Apr 7, 2013 at 12:34 AM, Shoaib Asghar <dearshoaib@gmail.com> wrote:

My MBA is also complete.

On Sun, Mar 31, 2013 at 3:45 AM, ●๋•ιмяαη αℓι●๋• <candle.in.winds@gmail.com> wrote:

Haan

On Mar 27, 2013 12:29 PM, "Farrukh Farooq" <farruk13@gmail.com> wrote:

Yah pur koe aisa student ha jis ney MBA complete ker lea ho?

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en
---
You received this message because you are subscribed to the Google Groups ":::www.vuaskari.com :::" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vuaskari_com+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join

--
Sent from Gmail Mobile
MBA Marketing (Completed)

--
Sent from Gmail Mobile
MBA Marketing (Completed)

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en
---
You received this message because you are subscribed to the Google Groups ":::www.vuaskari.com :::" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vuaskari_com+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

--
asdfff

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

I think either a bst or avl tree will work fine for this scenario.

List of offenders should be loaded faster with the possibility to identify one as quickly as possible.

The trees can load the data faster because they preserve some order as compare to link list, queue or stack in which for each value we may need to find its right place and then rearrange whole thing. The other benefits of using tree is that the one offender can be found easily as we know that it takes nlog(n) to search in tree as compare to O(n) in link list, queue or stack.

Add/Remove Offenders:

The trees are faster to add data in them because we know that it will goes to its right place without the need of traversing the whole tree and usually requires nlog(n) to insert data. This is oppose to linked list, queue or stack in which we first have to search its right place and it can be worst to transverse whole data structure, so for them it can be O(1) but also O(n).

Deleting the offender from stack, queue and link list usually requires much time it can be O(1) if last but it can also be O(n) if it is first as compare to tree which is usually takes nlog(n).

Merging two offenders list:

The merging of two offenders list in linked list, stack and queue takes O(n + m) times where n & m are offender in two list. But in case of tree with appropriate use of algorithm it can O(n log n).

On Mon, Jun 24, 2013 at 10:11 AM, aspirant bibliophile <aspirant.bibliophile@gmail.com> wrote:

Question:

Suppose you are a game developer in a company and you have been given the task to develop a game which should fulfill all requirements mentioned below:

The game plots a bank robbery. Lots of people witness that robbery. Our game will load the lists of suspected offenders while the players (witnesses) will have to identify the offenders of this robbery. Game should load list of offenders to identify the one as quickly as possible. Admin can add/remove offenders in the lists and two or more lists of offenders can also be merged into one (to show it to the player).

As a game developer, which data structure you will use to develop the game? Justify your selection with solid arguments. Remember the most critical requirement is that the list should load super fast.

Note: A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.

Best of Luck!

--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en

Re: ::: vuaskari.com ::: check it acc 501 asigmnt!!!

On Mon, Jun 24, 2013 at 6:26 AM, Waqas Ahmed Tanoli <waqasahmedtanoli@gmail.com> wrote:

Schedule of Cash Flows Discounted at 10% [Project "A"]

Year

Outflows

Inflows

Net
Cash Flow

Discounted
Cash Flow

0

$250,000.00

-$250,000.00

-$250,000.00

1

$30,000.00

$30,000.00

$27,272.73

2

$50,000.00

$50,000.00

$41,322.31

3

$60,000.00

$60,000.00

$45,078.89

4

$90,000.00

$90,000.00

$61,471.21

5

$100,000.00

$100,000.00

$62,092.13

6

$120,000.00

$120,000.00

$67,736.87

Totals:

$250,000.00

$450,000.00

$200,000.00

$54,974.14

Schedule of Cash Flows Discounted at 10% [Project "B" ]

Year

Outflows

Inflows

Net
Cash Flow

Discounted
Cash Flow

0

$250,000.00

-$250,000.00

-$250,000.00

1

$70,000.00

$70,000.00

$63,636.36

2

$80,000.00

$80,000.00

$66,115.70

3

$90,000.00

$90,000.00

$67,618.33

4

$40,000.00

$40,000.00

$27,320.54

5

$20,000.00

$20,000.00

$12,418.43

6

$10,000.00

$10,000.00

$5,644.74

Totals:

$250,000.00

$310,000.00

$60,000.00

-$7,245.90

Profitability Index for Project "A"

Profitability Index = 1 + (Net Present Value / Initial Investment Required)

Profitability Index = 1 + (54,974.14/250,000)

Profitability Index = 1 +0.2199

Profitability Index = 1.21

Profitability Index for Project "B"

Profitability Index = 1 + (Net Present Value / Initial Investment Required )

Profitability Index = 1 + (Net Present Value / Initial Investment Required )

Profitability Index = 1 + (-7245.90/250000)

Profitability Index = 1 – 0.029

Profitability Index = 0.972

Under profitability index if the PI is more than 1 the project is accepted on the other hand if it is less than 1 it is rejected. Under net present value if NPV is positive project is accepted else it is rejected.

Only the Net Present Value decision rule will always lead to the correct decision when choosing among Mutually Exclusive Projects

For mutually exclusive projects, the decision rule is to choose the project with the greatest NPV

On Mon, Jun 24, 2013 at 12:18 AM, Waqas Ahmed Tanoli <waqasahmedtanoli@gmail.com> wrote:
> On Sun, Jun 23, 2013 at 10:55 PM, Shamim Bano <mc110404351@gmail.com> wrote:
>> Thnx
>> mera tu payback period 4.8 and 3.75 aa raha hy
>>
>> PI kasy nikalna hy
>>
>>
>> On Sun, Jun 23, 2013 at 9:02 AM, Yumiko Shahid <sweetyumiko745@gmail.com>
>> wrote:
>>>
>>> ye check krna or idea dey do mujhy ma kr loo gi solve
>>>
>>> --
>>> We say, "Be one as Pakistani Nation and grow up for Pakistan's Future".
>>> Wish you all the best. Join www.vuaskari.com,
>>> To post to this group, send email to vuaskari_com@googlegroups.com
>>> Visit these groups:
>>> This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
>>> MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
>>> HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
>>> Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
>>> Management: https://groups.google.com/group/vuaskari_mgt?hl=en
>>> Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
>>> MIS Group: http://groups.google.com/group/askari_mis?hl=en
>>>
>>>
>>
>>
>> --
>> We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish
>> you all the best. Join www.vuaskari.com,
>> To post to this group, send email to vuaskari_com@googlegroups.com
>> Visit these groups:
>> This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
>> MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
>> HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
>> Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
>> Management: https://groups.google.com/group/vuaskari_mgt?hl=en
>> Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
>> MIS Group: http://groups.google.com/group/askari_mis?hl=en
>>
>>

ALL UNIVERSITIES AND SERVICE COMMISSIONS PAST PAPERS IN PAKISTAN

Pages

PROMOTE MY BLOG: JUST CLICK BELOW BUTTON

Search Any Paper On This Blog

Tuesday, June 25, 2013

Re: ::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

Re: ::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

::: vuaskari.com ::: AOA! plx send me idea solution of sta 630 plxxxxx

Monday, June 24, 2013

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

Re: ::: vuaskari.com ::: MBA Completion

Re: ::: vuaskari.com ::: GDB for Data Structures (CS301) June 24 - 25

Re: ::: vuaskari.com ::: check it acc 501 asigmnt!!!

Schedule of Cash Flows Discounted at 10% [Project "A"]
Year	Outflows	Inflows	Net Cash Flow	Discounted Cash Flow
0	$250,000.00		-$250,000.00	-$250,000.00
1		$30,000.00	$30,000.00	$27,272.73
2		$50,000.00	$50,000.00	$41,322.31
3		$60,000.00	$60,000.00	$45,078.89
4		$90,000.00	$90,000.00	$61,471.21
5		$100,000.00	$100,000.00	$62,092.13
6		$120,000.00	$120,000.00	$67,736.87
Totals:	$250,000.00	$450,000.00	$200,000.00	$54,974.14