CS502 – Fundamentals of Algorithms
In CS502 Fundamentals of Algorithms we have you covered with Digitized Past Papers From Fall of Mid Term and Final Term.
NOTE: Tab/Click on Preparation Tab to take the MCQ’s Tests.
CS502_Finalallquizinonefile2013 View Download
CS502_FinalMCQS_big_file_of_ View Download
CS502_FinalMCQsbyM View Download
CS502_FinalMcqsforTermfaisal View Download
CS502_FinalReferenceSubjectives View Download
CS502_FinalSolvedMCQSwithreferencesbyAwais_2 View Download
CS502_FinalSolvedPapersMCQs View Download
CS502_Finalterm_Quiz_Solved_By_HunainRaza View Download
CS502_FinalTermSolvedMCQSAwais View Download
CS502_FinaltermsolvedMcqsMoaaz View Download
CS502_Mid_Mcqs_Ref_Moaaz View Download
CS502_Mid_Subj_Ref_Moaaz View Download
CS502_Mid_Dr_Tariq_Hanif View Download
CS502_Mid_MCQs_Mega_One1 View Download
CS502_Mid_Subje_by_Moaaz View Download
POSTED DATE:25-01-2019 IDEA SOLUTION
Question # 1:
Consider the following five matrices A, B, C, D and E along with their dimensions;
A B C D E
(6×5) (5×1) (1×7) (7×4) (4×2)
Determine the Optimal Multiplication Order for above matrices using Dynamic Programming approach and also present the sequence (i.e. optimal order) in Binary Tree.
Question # 2:
List down In and Out- Degrees of vertices of the given directed graph
|Vertex||In Degree||Out Degree|
- How many cycles are there in the given directed graph, list all of them. Further, is there any Hamiltonian cyclein it (yes/no)?
There is one cycles in this graph which are listed below.
Hamiltonian Cycle = no
CS502– Practice Quiz 1
CS502– Practice Quiz 2