CSS, PMS, PCS, LECTURER, PHD, MPHIL, MS(CS) MCS,BS(CS), M.A/M.Sc, BBA, B.Com, D.Com....

## Saturday, February 16, 2013

### ::: vuaskari.com :::

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.

### Re: ::: vuaskari.com ::: MGT601 Quiz no.04 Cancellation and Quiz no.05

--

Quiz no.04 Cancellation and Quiz no.05 Dated: Feb 08, 13

Important announcement

Quiz no.04 Cancellation and quiz no.05

SME Management (MGT601)

Dear StudentsIt has been observed that erroneously quiz no.04 is showing only two questions thus the quiz no.04 has been declared as non-graded. Kindly note, a new graded quiz will be opened on the following dates.

Quiz 5Opening date: 12 February, 2013

Closing date: 14 February, 2013.

Instructions:

· You can start attempting the quiz at any time but within given date(s) by clicking the quick link for Quiz on VU-LMS as it will become enabled within the mentioned dates. As soon as the time will be over, it will automatically be disabled and will not be available to attempt it.

· Quiz will be based on Multiple Choice Questions (MCQs). Covering video Lectures 15 to 35.

· Each question has a fixed time limit of 90 seconds. So you have to save your answer before 90 seconds. But due to unpredictable/unstable Internet speed, it is strongly recommended that you save your answer within 60 seconds to avoid any inconvenience. While attempting a question, keep an eye on the remaining time.

· Attempting quiz is unidirectional. Once you have moved forward to the next question, you will not be able to go back to the previous one. Therefore before moving to the next question, make sure that you have selected the best option and saved your answer.

· DO NOT press back button of your browser or refresh the page while attempting a question. Otherwise you will lose the chance of attempting the current question and a new question will be loaded.

· DO NOT try to disable "Java Script" in your browser; otherwise you will not be able to attempt the quiz.

· If for any reason, you lose access to Internet (like power failure or disconnection of Internet); you will be able to attempt the quiz again but from the next question where you left in last attempt. But remember that you have to complete the quiz before expiry of the deadline.

· If you failed to attempt the quiz in given time then no re-take or off line quiz will be held as compensation/replacement.

Note related to load shedding: Please be proactive

Dear students!As you know that Post Mid-Term semester activities have been started and load shedding problem is also prevailing in our country now a days. Keeping in view the fact, you all are advised to post your activities as early as possible without waiting for the due date. For your convenience; activity schedule has already been uploaded on VULMS for the current semester, therefore no excuse will be entertained after due date of assignments, quizzes or GDBs.

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan **©yberian

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

---

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.

### ::: vuaskari.com ::: CS507 Solved Final term papers

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.

### ::: vuaskari.com ::: MGT503 Final terms solved

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.

### Re: ::: vuaskari.com ::: Need Guess Paper :)

Need guess paper for FINAL TERM......CS507 - Information Systems

FIN621 - Financial Statement AnalysisMGT402 - Cost & Management AccountingMGT503 - Principles of ManagementMKT501 - Marketing Management--

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.

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan *

*****

*©yberian*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.

### ::: vuaskari.com ::: MGT501 Final term Material

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.

### ::: vuaskari.com ::: Need Guess Paper :)

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.

### ::: vuaskari.com ::: plz send me mgt 501 pastpapers!!!!

--

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.

### ::: vuaskari.com ::: MGT502 Final term Solved papers

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan * *©yberian* <ddrc14@gmail.com> *

--

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.

### ::: vuaskari.com ::: ENG301 Final term Solved papers

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan * *©yberian* <ddrc14@gmail.com> *

--

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.

### ::: vuaskari.com ::: IT430 Final term Solved papers

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan * *©yberian* <ddrc14@gmail.com> *

--

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.

### Re: ::: vuaskari.com ::: aoa

On 2/15/13, Azmi <azmays@gmail.com> wrote:

> plzz maughy mgt601 k finalterm paper chay plzzzzzzzzzzzzzzzzzzzzzzzzz

>

>

> On Fri, Feb 15, 2013 at 9:15 AM, Azmi <azmays@gmail.com> wrote:

>

>> plzz maughy mgt601 k finalterm paper chay plzzzzzzzzzzzzzzzzzzzzzzzzz

>>

>>

>> On Sun, Feb 10, 2013 at 9:20 AM, Azmi <azmays@gmail.com> wrote:

>>

>>> plzz maughy mgt601 k finalterm paper chay plzzzzzzzzzzzzzzzzzzzzzzzzz

>>>

>>> --

>>> 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

> ---

> 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.

>

>

>

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan * *©yberian* <ddrc14@gmail.com> *

--

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.

### Re: ::: vuaskari.com ::: Happy Birth Day Admin DuaWaqar

On 2/16/13, Zahid Adnan <zahidchand2000@gmail.com> wrote:

> Many Many Happy returnes of the day ,, Happy Birth day Admin Dua waqar g ,,

> best of luck ,, be happy with ur kids and family

> --

> *M.Zahid <M.Z@h!d> Adnan <Adn@n>*

> *MIT Final Semester*

> Layyah Campus

> *Cs410,Cs502,Cs601,Cs604,Mgt501,Mgt602*

> * **

> *

>

> --

> 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.

>

>

>

--

for more info Visit www.vuaskari.com/index.php

Regards

Ali Khan * *©yberian* <ddrc14@gmail.com> *

--

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.

### ::: vuaskari.com ::: Happy Birth Day Admin DuaWaqar

Many Many Happy returnes of the day ,, Happy Birth day Admin Dua waqar g ,, best of luck ,, be happy with ur kids and family

--

**Cs410,Cs502,Cs601,Cs604,Mgt501,Mgt602**

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.

## Friday, February 15, 2013

### Re: ::: vuaskari.com ::: Request for Required final term solved papers those subject

On Mon, Feb 11, 2013 at 1:07 PM, Rj Babloo <rjbabloo796@gmail.com> wrote:

Requested for past paperIT430mgt 502mgt501sta301eng301

--Hi main ho Rj Ali--

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

---

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.

### Re: ::: vuaskari.com ::: Viva

Dear fellows,

Any idea when power point presentations of Project would start, or how difficult the viva is?

Best RegardsOn Feb 13, 2013 4:42 PM, "Muhammad Asif" <itsvividmirror@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

---

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

---

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.

### ::: vuaskari.com ::: CS502 QUIZ NO.5 DATED FEB 15 2013

**CS502 - Fundamentals of Algorithms**

**Quiz No.5 Dated FEB 15 ^{TH} 2013**

In in-place sorting algorithm is one that uses arrays for storage :

An additional array

**No additional array**** (Right Answer)**

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

The running time of quick sort depends heavily on the selection of

No of inputs

Arrangement of elements in array

Size o elements

**Pivot element ****(Right Answer)**

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required.

**Duplicating elements remain in same relative position after sorting. ****(Right Answer)**

** **

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

**O(n+k) ****(Right Answer)**

O(n^3)

In Quick sort algorithm,constants hidden in T(n lg n) are

Large

Medium

Not known

**Small ****(Right Answer)**

** **

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

**There is explicit combine process as well to conquer the solutin. (Right Answer)**

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

Both are equal.

Cycles are half of back edges.

Cycles are one fourth of back edges.

** There is no relationship between back edges and number of cycle ****(Right Answer)**

** **

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

** (V+E) ****(Right Answer)**

V.E

V

E

Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

**?(V + E) ****Right Answer)**

?(V E)

?(V)

?(V^2)

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

**log (V) (****Right Answer)**

V.V

E.E

log (E)

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

**Has greedy approach to compute single source shortest paths to all other vertices (****Right Answer)**

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

**O (log V) (****Right Answer)**

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

**Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges ) (****Right Answer)**

** **

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

**There is no relationship between no. of edges and cycles (****Right Answer)**

** **

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

**True (****Right Answer)**

False

** **

** **

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

**log (V)**

V.V

E.E

log (E)

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

**O(|V | |E|) (****Right Answer)**

O(|V |^2|E|)

O(|V | + |E|)

What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

**Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) ****Right Answer)**

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

**The Isolated vertex is not handled in list. (not Sure)**

Only one value is entered in the list.

There is at least one null list.

A dense undirected graph is:

Select correct option:

**A graph in which E = O(V^2) ****(Right Answer)**

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

**The DFS forest has back edge (****Right Answer)**

The DFS forest has both back and forward edge

BFS forest has forward edge

Back edge is:

Select correct option:

**(u, v) where v is an ancestor of u in the tree. (****Right Answer)**

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

64

**128 (****Right Answer)**

96

120

Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

**(u, v) where u and v are not ancestor or descendent of one another (****Right Answer)**

(u, v) where u and v are either ancestor or descendent of one another.

Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

**Both of above ****Right Answer)**

None of above

10 If you find yourself in maze the better traversel approach will bE

A dense undirected graph is:

Select correct option:

**A graph in which E = O(V^2) ****(Right Answer)**

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

Which is true statement.

Select correct option:

**Breadth first search is shortest path algorithm that works on un-weighted graphs ****(Right Answer)**

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.

Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

**(u, v) where v is a proper descendent of u in the tree. (****Right Answer)**

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.

Back edge is:

Select correct option:

**(u, v) where v is an ancestor of u in the tree. (****Right Answer)**

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

**O(|V | |E|) (****Right Answer)**

O(|V |^2|E|)

O(|V | + |E|)

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

**The DFS forest has back edge (****Right Answer)**

The DFS forest has both back and forward edge

BFS forest has forward edge

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

**The Isolated vertex is not handled in list. (not Sure)**

Only one value is entered in the list.

There is at least one null list.

If you find yourself in maze the better traversel approach will be :

BFS

**BFS and DFS both are valid ****(Right Answer)**

Level order

DFS

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

**(u, v) where u and v are not ancestor or descendent of one another (****Right Answer)**

(u, v) where u and v are either ancestor or descendent of one another.

What algorithm technique is used in the implementation of Kruskal solution for the MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

**True (****Right Answer)**

False

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

**?(V + E) ****Right Answer)**

? (V E)

? (V)

? (V^2)

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

**A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (****Right Answer)**

A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.

A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

**There is no relationship between no. of edges and cycles (****Right Answer)**

What algorithm technique is used in the implementation of Kruskal solution for the MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

In in-place sorting algorithm is one that uses arrays for storage :

An additional array

**No additional array**** (Right Answer)**

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

The running time of quick sort depends heavily on the selection of

No of inputs

Arrangement of elements in array

Size o elements

**Pivot element ****(Right Answer)**

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required.

**Duplicating elements remain in same relative position after sorting. ****(Right Answer)**

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

**O(n+k) ****(Right Answer)**

O(n^3)

In Quick sort algorithm,constants hidden in T(n lg n) are

Large

Medium

Not known

**Small ****(Right Answer)**

** **

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

**There is explicit combine process as well to conquer the solutin. (Right Answer)**

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

Both are equal.

Cycles are half of back edges.

Cycles are one fourth of back edges.

** There is no relationship between back edges and number of cycle ****(Right Answer)**

** **

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

** (V+E) ****(Right Answer)**

V.E

V

E

Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

**?(V + E) ****Right Answer)**

?(V E)

?(V)

?(V^2)

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

**log (V) (****Right Answer)**

V.V

E.E

log (E)

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

**Has greedy approach to compute single source shortest paths to all other vertices (****Right Answer)**

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

**O (log V) (****Right Answer)**

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

**Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges ) (****Right Answer)**

** **

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

**There is no relationship between no. of edges and cycles (****Right Answer)**

** **

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

**True (****Right Answer)**

False

** **

** **

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

**log (V)**

V.V

E.E

log (E)

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

**O(|V | |E|) (****Right Answer)**

O(|V |^2|E|)

O(|V | + |E|)

What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

**Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) ****Right Answer)**

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

**The Isolated vertex is not handled in list. (not Sure)**

Only one value is entered in the list.

There is at least one null list.

A dense undirected graph is:

Select correct option:

**A graph in which E = O(V^2) ****(Right Answer)**

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

**The DFS forest has back edge (****Right Answer)**

The DFS forest has both back and forward edge

BFS forest has forward edge

Back edge is:

Select correct option:

**(u, v) where v is an ancestor of u in the tree. (****Right Answer)**

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

64

**128 (****Right Answer)**

96

120

Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

**(u, v) where u and v are not ancestor or descendent of one another (****Right Answer)**

(u, v) where u and v are either ancestor or descendent of one another.

Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

**Both of above ****Right Answer)**

None of above

10 If you find yourself in maze the better traversel approach will bE

A dense undirected graph is:

Select correct option:

**A graph in which E = O(V^2) ****(Right Answer)**

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

Which is true statement.

Select correct option:

**Breadth first search is shortest path algorithm that works on un-weighted graphs ****(Right Answer)**

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.

Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

**(u, v) where v is a proper descendent of u in the tree. (****Right Answer)**

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.

Back edge is:

Select correct option:

**(u, v) where v is an ancestor of u in the tree. (****Right Answer)**

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Select correct option:

O(|V |^2)

**O(|V | |E|) (****Right Answer)**

O(|V |^2|E|)

O(|V | + |E|)

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

**The DFS forest has back edge (****Right Answer)**

The DFS forest has both back and forward edge

BFS forest has forward edge

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

**The Isolated vertex is not handled in list. (not Sure)**

Only one value is entered in the list.

There is at least one null list.

If you find yourself in maze the better traversel approach will be :

BFS

**BFS and DFS both are valid ****(Right Answer)**

Level order

DFS

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

**(u, v) where u and v are not ancestor or descendent of one another (****Right Answer)**

(u, v) where u and v are either ancestor or descendent of one another.

What algorithm technique is used in the implementation of Kruskal solution for the MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

**True (****Right Answer)**

False

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

**?(V + E) ****Right Answer)**

? (V E)

? (V)

? (V^2)

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

**A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (****Right Answer)**

A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.

A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

**There is no relationship between no. of edges and cycles (****Right Answer)**

What algorithm technique is used in the implementation of Kruskal solution for the MST?

**Greedy Technique (****Right Answer)**

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

Which may be stable sort:

Select correct option:

Bubble sort

Insertion sort

**Both of above**

Selection sort

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,

Select correct option:

linear

arithmetic

**geometric**

exponent

In Quick sort algorithm, constants hidden in T(n lg n) are

Select correct option:

Large

Medium

Not known

**small**

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

**T(n)**

T( log n)

T(n log n)

Counting sort has time complexity:

Select correct option:

**O(n)**

O(n+k)

O(k)

O(nlogn)

In which order we can sort?

Select correct option:

increasing order only

decreasing order only

**increasing order or decreasing order**

both at the same time

A (an) _________ is a left-complete binary tree that conforms to the heap order

Select correct option:

**heap**

binary tree

binary search tree

array

The analysis of Selection algorithm shows the total running time is indeed ________in n,

Select correct option:

arithmetic

geometric

**linear**

orthogonal

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:

Select correct option:

There is explicit combine process as well to conquer the solution.

No work is needed to combine the sub-arrays, the array is already sorted

Merging the sub arrays

**None of above.**

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,

Select correct option:

upper

**lower**

average

log n

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

T(n)

**T(n / 2)**

log n

n / 2 + n / 4

Quick sort is based on divide and conquer paradigm; we divide the problem on base of

pivot element and:

There is explicit combine process as w ell to conquer

No w ork is needed to combine the sub-arrays, the a

Merging the subarrays

**None of above**

The number of nodes in a complete binary tree of height h is

**2^(h+1) – 1**

2 * (h+1) – 1

2 * (h+1)

((h+1) ^ 2) – 1

How many elements do we eliminate in each time for the Analysis of Selection

algorithm?

n / 2 elements

(n / 2) + n elements

n / 4 elements

2 n elements

Which sorting algorithn is faster :

O(n^2)

**O(nlogn)**

O(n+k)

O(n^3)

We do sorting to,

**keep elements in random positions**

keep the algorithm run in linear order

keep the algorithm run in (log n) order

keep elements in increasing or decreasing order

Slow sorting algorithms run in,

**T(n^2)**

T(n)

T( log n)

T(n log n)

One of the clever aspects of heaps is that they can be stored in arrays without using any

_______________.

**Pointers**

Constants

Variables

Functions

Counting sort is suitable to sort the elements in range 1 to k:

K is large

**K is small**

K may be large or small

None

We do sorting to,

Select correct option:

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

**keep elements in increasing or decreasing order**

Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,

Select correct option:

**left-complete**

right-complete

tree nodes

tree leaves

Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1

Sieve Technique can be applied to selection problem?

Select correct option:

**True**

False

Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1

A heap is a left-complete binary tree that conforms to the ___________

Select correct option:

increasing order only

decreasing order only

**heap order**

(log n) order

Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1

A (an) _________ is a left-complete binary tree that conforms to the heap order

Select correct option:

**heap**

binary tree

binary search tree

array

Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1

Divide-and-conquer as breaking the problem into a small number of

Select correct option:

pivot

Sieve

**smaller sub problems**

Selection

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

**True**

False

Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?

Select correct option:

16

10

**32**

31

Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,

Select correct option:

linear

arithmetic

**geometric **

exponent

Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1

For the heap sort, access to nodes involves simple _______________ operations.

Select correct option:

**arithmetic**

binary

algebraic

logarithmic

For the sieve technique we solve the problem,

Select correct option:

**recursively**

mathematically

precisely

accurately

The sieve technique works in ___________ as follows

Select correct option:

**phases**

numbers

integers

routines

Slow sorting algorithms run in,

Select correct option:

**T(n^2)**

T(n)

T( log n)

A (an) _________ is a left-complete binary tree that conforms to the heap order

Select correct option:

**heap**

binary tree

binary search tree

array

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,

Select correct option:

linear

arithmetic

**geometric**

exponent

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

Select correct option:

T(n)

**T(n / 2)**

log n

n / 2 + n / 4

The sieve technique is a special case, where the number of sub problems is just

Select correct option:

5

many

**1**

few

In which order we can sort?

Select correct option:

increasing order only

decreasing order only

**increasing order or decreasing order**

both at the same time

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?

Select correct option:

16

10

**32**

31

Analysis of Selection algorithm ends up with,

Select correct option:

T(n)

T(1 / 1 + n)

T(n / 2)

**T((n / 2) + n)**

We do sorting to,

Select correct option:

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

**keep elements in increasing or decreasing order**

Divide-and-conquer as breaking the problem into a small number of

Select correct option:

pivot

Sieve

**smaller sub problems**

Selection

The analysis of Selection algorithm shows the total running time is indeed ________in n,

Select correct option:

arithmetic

geometric

**linear **

orthogonal

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

Select correct option:

**n / 2 elements**

(n / 2) + n elements

n / 4 elements

2 n elements

Sieve Technique can be applied to selection problem?

Select correct option:

**True **

false

For the heap sort we store the tree nodes in

Select correct option:

**level-order traversal**

in-order traversal

pre-order traversal

post-order traversal

One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.

Select correct option:

**pointers**

constants

variables

functions

A (an) _________ is a left-complete binary tree that conforms to the heap order

Select correct option:

**heap**

binary tree

binary search tree

array

Divide-and-conquer as breaking the problem into a small number of

Select correct option:

pivot

Sieve

**smaller sub problems**

Selection

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,

Select correct option:

**left-complete**

right-complete

tree nodes

tree leaves

For the sieve technique we solve the problem,

Select correct option:

**recursively**

mathematically

precisely

accurately

A heap is a left-complete binary tree that conforms to the ___________

Select correct option:

increasing order only

decreasing order only

**heap order**

(log n) order

We do sorting to,

Select correct option:

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

**keep elements in increasing or decreasing order**

How many elements do we eliminate in each time for the Analysis of Selection algorithm?

Select correct option:

**n / 2 elements**

(n / 2) + n elements

n / 4 elements

2 n elements

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

T(n)

T( log n)

**T(n log n)**

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Select correct option:

**divide-and-conquer**

decrease and conquer

greedy nature

2-dimension Maxima

Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1

The number of nodes in a complete binary tree of height h is

Select correct option:

**2^(h+1) – 1**

2 * (h+1) – 1

2 * (h+1)

((h+1) ^ 2) – 1

Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1

A (an) _________ is a left-complete binary tree that conforms to the heap order

Select correct option:

**heap**

binary tree

binary search tree

array

Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

**True**

False

Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1

Heaps can be stored in arrays without using any pointers; this is due to the

____________ nature of the binary tree,

Select correct option:

**left-complete**

right-complete

tree nodes

tree leaves

Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as

many as,

Select correct option:

T(n)

**T(n / 2)**

log n

n / 2 + n / 4

Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1

For the sieve technique we solve the problem,

Select correct option:

**recursively**

mathematically

precisely

accurately

Theta asymptotic notation for T (n) :

Select correct option:

Set of functions described by: c1g(n)Set of functions described by c1g(n)>=f(n) for c1 s

Theta for T(n)is actually upper and worst case comp

Set of functions described by:

c1g(n)

Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1

The sieve technique is a special case, where the number of sub problems is just

Select correct option:

5

many

**1**

few

Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1

Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________

Select correct option:

**n items**

phases

pointers

constant

Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1

The sieve technique works in ___________ as follows

Select correct option:

**phases**

numbers

integers

routines

Memorization is?

To store previous results for future use

**To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later**

To make the process accurate

None of the above

Question # 2 of 10 Total M a r k s: 1

Which sorting algorithm is faster

O (n log n)

O n^2

**O (n+k)**

O n^3

Quick sort is

Stable & in place

**Not stable but in place**

Stable but not in place

Some time stable & some times in place

One example of in place but not stable algorithm is

Merger Sort

**Quick Sort**

Continuation Sort

Bubble Sort

In Quick Sort Constants hidden in T(n log n) are

Large

Medium

**Small**

Not Known

Continuation sort is suitable to sort the elements in range 1 to k

K is Large

K is not known

**K may be small or large**

**K is small**

In stable sorting algorithm.

One array is used

More than one arrays are required

Duplicating elements not handled

**duplicate elements remain in the same relative position after sorting**

Which may be a stable sort?

Merger

Insertion

Both above

**None of the above**

An in place sorting algorithm is one that uses ___ arrays for storage

Two dimensional arrays

More than one array

**No Additional Array**

None of the above

Continuing sort has time complexity of ?

**O(n)**

O(n+k)

O(nlogn)

O(k)

We do sorting to,

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

**keep elements in increasing or decreasing order **

In Sieve Technique we donot know which item is of interest

**True **

False

A (an) _________ is a left-complete binary tree that conforms to the

heap order

**heap**

binary tree

binary search tree

array

27. The sieve technique works in ___________ as follows

**phases**

numbers

integers

routines

For the sieve technique we solve the problem,

**recursively**

mathematically

precisely

accurately

29. For the heap sort, access to nodes involves simple _______________

operations.

**arithmetic**

binary

algebraic

logarithmic

The analysis of Selection algorithm shows the total running time is

indeed ________in n,\

arithmetic

geometric

**linear**

orthogonal

For the heap sort, access to nodes involves simple _______________

operations.

Select correct option:

**arithmetic**

binary

algebraic

logarithmic

Sieve Technique applies to problems where we are interested in finding a

single item from a larger set of _____________

Select correct option:

**n items**

phases

pointers

constant

Question # 9 of 10 ( Start time: 07:45:36 AM ) Total Marks: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

**True**

False

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

T(n)

T( log n)

**T(n log n)**

For the heap sort we store the tree nodes in

Select correct option:

**level-order traversal**

in-order traversal

pre-order traversal

post-order traversal

Sorting is one of the few problems where provable ________ bonds exits on

how fast we can sort,

Select correct option:

upper

**lower**

average

log n

single item from a larger set of _____________

Select correct option:

**n items**

phases

pointers

constant

A heap is a left-complete binary tree that conforms to the ___________

Select correct option:

increasing order only

decreasing order only

**heap order**

(log n) order

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

Select correct option:

T(n)

**T(n / 2**)

log n

n / 2 + n / 4

The reason for introducing Sieve Technique algorithm is that it illustrates a

very important special case of,

Select correct option:

**divide-and-conquer**

decrease and conquer

greedy nature

2-dimension Maxima

The sieve technique works in ___________ as follows

Select correct option:

**phases**

numbers

integers

routines

For the Sieve Technique we take time

Select correct option:

**T(nk)**

T(n / 3)

n^2

n/3

In the analysis of Selection algorithm, we eliminate a constant fraction of the

array with each phase; we get the convergent _______________ series in the

analysis,

linear

arithmetic

**geometric**

exponent

Analysis of Selection algorithm ends up with,

Select correct option:

**T(n)**

T(1 / 1 + n)

T(n / 2)

T((n / 2) + n)

Quiz Start Time: 07:23 PM

Time Left 90

sec(s)

Question # 1 of 10 ( Start time: 07:24:03 PM ) Total M a r k s: 1

In in-place sorting algorithm is one that uses arrays for storage :

Select correct option:

An additional array

**No additional array**

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

Time Left 89

sec(s)

Question # 2 of 10 ( Start time: 07:25:20 PM ) Total M a r k s: 1

Which sorting algorithn is faster :

Select correct option:

O(n^2)

**O(nlogn)**

O(n+k)

O(n^3)

In stable sorting algorithm:

Select correct option:

One array is used

In which duplicating elements are not handled.

More then one arrays are required.

**Duplicating elements remain in same relative posistion after sorting.**

Counting sort has time complexity:

Select correct option:

**O(n)**

O(n+k)

O(k)

O(nlogn)

Counting sort is suitable to sort the elements in range 1 to k:

Select correct option:

K is large

**K is small**

K may be large or small

None

Memorization is :

Select correct option:

To store previous results for further use.

**To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later**

To make the process accurate.

None of the above

The running time of quick sort depends heavily on the selection of

Select correct option:

No of inputs

Arrangement of elements in array

Size o elements

**Pivot elements**

Which may be stable sort:

Select correct option:

Bubble sort

Insertion sort

**Both of above**

In Quick sort algorithm, constants hidden in T(n lg n) are

Select correct option:

Large

Medium

Not known

**small**

Quick sort is

Select correct option:

Stable and In place

**Not stable but in place**

Stable and not in place

Some time in place and send some time stable

For the Sieve Technique we take time

**T(nk)**

T(n / 3)

n^2

n/3

The sieve technique is a special case, where the number of sub problems is just

Select correct option:

5

Many

**1**

Few

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Select correct option:

**divide-and-conquer**

decrease and conquer

greedy nature

2-dimension Maxima

Quick sort is

Select correct option:

Stable and In place

**Not stable but in place**

Stable and not in place

Some time in place and send some time stable

Memoization is :

Select correct option:

To store previous results for further use.

**To avoid unnecessary repetitions by writing down the results of**

recursive calls and looking them again if needed later

To make the process accurate.

None of the above

One Example of in place but not stable sort is

**Quick **

Heap

Merge

Bubble

The running time of quick sort depends heavily on the selection of

Select correct option:

No of inputs

Arrangement of elements in array

Size o elements

**Pivot elements**

** **

Question # 9 of 10 ( Start time: 07:39:07 PM ) Total M a r k s: 1

In Quick sort algorithm,constants hidden in T(n lg n) are

Select correct option:

Large

Medium

Not known

**Small**

** **

Theta asymptotic notation for T (n) :

Select correct option:

Set of functions described by: c1g(n)<=f(n) for c1 some constant and n=n0

Set of functions described by c1g(n)>=f(n) for c1 some constant and n=n0

Theta for T(n)is actually upper and worst case complexity of the code

**Set of functions described by: c1g(n)<=f(n)<=c2g(n) for c1 and c2 some constants and n=n0**

**Zindagi mein 2 Logo ka buhat khayal rahkoooo**

**Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo**

**(Father)**

**2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)**

**Regards,**

**Umair Saulat Mc100403250**

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.