=====================================================
**Keep visiting this site and link. Same links will be updated with time**
======================================================
Paper 1:
CS502
mcqs almost 30 from past
draw spanning tree,
why kanpsack call 0/1,
three matrices was given we have to calculate values and tell which one is best,
what is vertics and edges
activity selection
draw adjancy list from given graph
from dijkstra,floyd nd karskal which one allow negtve edge nd ngtve cycle..
from given list tell there is loop or not nd also tell the property.
mcqs almost 30 from past
draw spanning tree,
why kanpsack call 0/1,
three matrices was given we have to calculate values and tell which one is best,
what is vertics and edges
activity selection
draw adjancy list from given graph
from dijkstra,floyd nd karskal which one allow negtve edge nd ngtve cycle..
from given list tell there is loop or not nd also tell the property.
