We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

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


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS502 Fundamentals of Algorithms Assignment#05 Solution & Discussion Due Date: 08-07-2011

Fundamentals of Algorithms

CS502-Spring 2011

  Assignment #5

Deadline

 

Your assignment must be uploaded/submitted at or before 8th   JULY 2011

Uploading instructions

 

Please view the assignment submission process document provided to you by the Virtual University to upload the assignment.

Rules for Marking

 

It should be clear that your assignment will not get any credit if:

 

  • oThe assignment is submitted after due date.
  • oThe submitted assignment does not compile or run.
  • oThe assignment is copied.

Objectives

 

This assignment will help you to understand the concepts of Knapsack Problem and Chain matrix Multiplication which results in efficient calculation time wise.

Guidelines

  1. 1.      In order to attempt this assignment you should have full command on Lecture # 39to Lecture # 45
  2. 2.      In order to solve this assignment you have strong concepts about following topics

ü     Polynomial Time Algorithms

ü     Non deterministic Polynomial time Algorithims

 

 

 

Recommended book for solving assignment

Cormen, Leiserson, Rivest, and Stein (CLRS) 2001, Introduction to Algorithms, (2nd ed.) McGraw  Hill.

 

Estimated Time    3  hours

 

You can make justified search for the topic in One hour and 1.5 hour to understand the whole themes you are asked and 0.5 hour to organize and type whole material.

What to submit

You are bound to submit word file only in the given format and given HEADLINES below. Negative marking will be done in case of violating the format provided to you.

 

 

Question# 1                    (9)

You are bound to answer the following queries relating to Polynomial time/space algorithms:

 

Formal Definition 1.5

 

 

How the given problem is identified the Problem is in P class

[You are only bound to give some hints/theorems no detail proofs]   4

 

 

 

 

 

 

 

Are these problems Feasible to Solve in available memory and time                       2

[Why or why not give constraints if any]

 

 

 

 

 

 

Examples                1.5

[General type examples are preferable]

 

 

Question# 2                   (9)

You are bound to answer the following queries relating to Non Deterministic Polynomial time/space algorithms:

 

Formal Definition 1.5

 

 

 

 

How the given problem is identified the Problem is in NP class 4

[You are only bound to give some hints/theorems no detail proofs, some more hints relating to NP classes are  preferable]  

 

 

 

 

 

Are these problems Feasible to Solve in available memory and time                       2

[Why or why not give constraints if any]

 

 

 

 

Examples                1.5

[General type examples are preferable; Classes of NP can be given with single line explanation]

 

 

 

 

Q 3   Conclusions                  2

[Here you have to write two to three sentences relating to final comments on P and NP problems]

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 258

.

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

Attachments:

Replies to This Discussion

yes please please

Please Discuss here about this assignment.Thanks

yes ok but please help
Tariq bhai - please arrange this solution
plz help sir today is extended day
please some one help us we are very confused about this assignment
please upload the idea solution please
please upload the sol
Any Idea sollution
please any body help us please and upload its solution
please hurry up today is last day of this assignment
Any idea solution please.............

RSS

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

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

.