07-03-2011, 01:12 AM
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]
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]
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]