DEAR ALL mine paper was so tough
MCQ just 5 old rest all NEW (i think touch the all chapters)
Q1-describe Asypotatic Notation
Q2- Table was given made the adjacent list
Q3 - G = (V,E) describe DSF is cyclic or not prove it
Q4 - free tree
Q5- reduction and example
Q6 - graph given write the final value *(bohat ajeeb sa graph tha value is main same then buhot to samaj nhi ah rahie the kay kis ko kis kay sath match karna hai )
Q7 - Yes and No also describe if A is divide to B and B is NP complete and A is also NP-Complete ?
Q8 - Floyd-Warshall Algorithm say tha
MCQ just 5 old rest all NEW (i think touch the all chapters)
Q1-describe Asypotatic Notation
Q2- Table was given made the adjacent list
Q3 - G = (V,E) describe DSF is cyclic or not prove it
Q4 - free tree
Q5- reduction and example
Q6 - graph given write the final value *(bohat ajeeb sa graph tha value is main same then buhot to samaj nhi ah rahie the kay kis ko kis kay sath match karna hai )
Q7 - Yes and No also describe if A is divide to B and B is NP complete and A is also NP-Complete ?
Q8 - Floyd-Warshall Algorithm say tha
0 comments
Post a Comment