We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

Virtual University of Pakistan Fall 2017 1 CS702 – Advanced Algorithms Analysis and Design Assignment 1 Instructions to Solve Assignments The purpose of the assignments is to give students hands on practice. It is expected that students will solve assignments themselves.The Following rules that will apply during the evaluation of the assignment.  Cheating from any source will result in zero marks in the assignment.  Any student found cheating in any two of the assignments submitted during the course will be awarded "F" grade in the course.  No assignment after the due date will be accepted. Virtual University of Pakistan Fall 2017 2 Answer the following questions in your own words. Plagiarism will be checked for each question. Marks will be awarded on the basis of the answer and plagiarism report. Question 1 (15 Marks) Show that A (A B) B    is a tautology by logical equivalence. Note: Don’t use truth table. Question 2 (20 Marks) Show by mathematical induction that any amount in cents ≥ n0 cents can be obtained using 6 cents and 7 cents coins only. Note: First you will need to calculate n0. Question 3 (15 Marks) Suppose sequence b0, b1, b2, . . ., satisfies the recurrence relation Then find explicit formula for b0, b1, b2, . . ., using the characteristic equation of the


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Views: 2221

Attachments:

Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Show by mathematical induction that any amount in cents ≥ n0 cents can be obtained using 6 cents and 7 cents coins only. Note: First you will need to calculate n0

Anybody help me about above mention Question...

CS702 - Advanced Algorithms Analysis and Design Assignment No. 1 Solution Fall 2017 Due Date: Nov 10, 2017 

 Virtual University of Pakistan

Fall 2017

CS702 – Advanced Algorithms Analysis and Design

 

 

 

 

 

 

 

 

 

Assignment 1

 

 

 

 

 

 

 

Instructions to Solve Assignments

 

 

The purpose of the assignments is to give students hands on practice. It is expected that students will solve assignments themselves.The  Following rules that will apply during the evaluation of the assignment.

?  Cheating from any source will result in zero marks in the assignment.

?  Any student found cheating in any two of the assignments submitted during the

course will be awarded "F" grade in the course.

?  No assignment after the due date will be accepted.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

1

 Virtual University of Pakistan

Fall 2017

Answer the following questions in your own words. Plagiarism will be checked for each question. Marks will be awarded on the basis of the answer and plagiarism report.

 

 

Question 1  


 


 


 


 


 


 


 


     (15 Marks)

Show that Note: Don’t use truth table.


 is a tautology by logical equivalence.

Question 2                                                                                                            (20 Marks)

Show by mathematical induction that any amount in cents ≥        n

0  cents can be obtained

using 6 cents and 7 cents coins only.

Note: First you will need to calculate n

0.

Question 3  

Suppose sequence b


 


 


 


 


 


 


 


     (15 Marks)

0, b1, b 2, . . ., satisfies the recurrence relation

 

 

 

 

Then find explicit formula for     b

0, b1, b 2, . . ., using the characteristic equation of the

above recursion.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

2

 

Please anyone can confirm if these questions are correctly solved as I found these questions from fb and solved by Tauseef Ahmed ????

As per my understanding Q.1 is correct but it not my solution as i copied from fb and for other parts still i am listening lectures.

And if we talk about law then 

As A->B=~A\/B so es ko replace kiya ha 

I think koi senior ho ga hamen behtr guide kr skta ha -- waiting... :)

in Question 2,why we put m>=5?
can anyone help me pls?

how the value of n could be 30 in Q.2

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

Yes I done my mba and mcs from VU and this website help me a lot since 2010 :) 

Dear student for the Answer 1 check this link for concepts
https://www.youtube.com/watch?v=okZcT1xBQ4Y
Regards

Yes got it thnx and Q2 and Q3 ??

Question no 2 is still unexplained....

can you do it step by step

RSS

Looking For Something? Search Here

HELP SUPPORT

This is a member-supported website. Your contribution is greatly appreciated!

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.