We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
Graded discussion (GDB) will be launched on 6th August, 2018 and it will remain open for two days. You can post your comments on the below mentioned topic till 7thAugust, 2018.
In order to design efficient algorithms, the analysts have agreed on the criterion for measuring algorithms which typically include running time and space (i.e. memory) and as well as some other computational resources that the algorithm requires. Since time and space dominate among other resources so analysts define them as;
Time: How long does the algorithm take to complete.
Space: How much working memory (typically RAM) is needed by the algorithm.
Hence, for an algorithm to be efficient, the above two factors should be optimized; the large amount of time and space results the less efficient algorithm and vice versa.
In the context of Graph Algorithms, do you agree or not with the given statement?
"An efficient algorithm takes small amount of time and as well as small amount of space to solve a graph theory problem."
A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. For any queries please email at CS502@vu.edu.pk
Best of Luck!
Share This With Friends......+ Click Here To Join also Our facebook study Group. This Content Originally Published by a member of VU Students.
CS502 gdb solution https://www.youtube.com/watch?v=BOZSfVnoszg
GRAPHS START IN LECTURE 27 32:00 and go and start listening !!!!!!!!!!!!!!!!
Watch lecture 28 45:50 he talks about storage...storage affects the speed of algorithm