Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Design and Analysis of Algorithms Old Questions 2075

Design and Analysis of Algorithms - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

8.  What types of problems are called class-P, class-NP and NP-completeness? Explain with examples.                                                                                                                       

8 marks
Asked in 2075

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...