search
Log In
0 votes
65 views

please give answer or name a book from where i can access

Describe two different data structures to represent a graph. For each such representa-
tion, specify a simple property about the graph that can be more efficiently checked
in that representation than in the other representation. Indicate the worst case time
required for verifying both of your properties in either representation.

in Written Exam
edited by
65 views
0
Adjacency List and Adjacency Matrix? Or Array or Linked List?

Please log in or register to answer this question.

Related questions

1 vote
1 answer
1
69 views
How many subsets of even cardinality does an n-element set have ? Justify answer. Please give a proof if possible.This is part of subjective JEST paper.
asked Feb 15, 2019 in Set Theory & Algebra sripo 69 views
2 votes
1 answer
2
279 views
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this.They decide to settle this by an actual trial; if within n coin tosses, no two consecutive ... has been demonstrated. What happens for larger values of n? Is it true that P(n) only increases with n? Justify your answer.
asked Feb 17, 2018 in Probability Sukannya 279 views
0 votes
0 answers
3
288 views
CSE- Jest exam rank-143 part -1 paper any chance of colleges
asked Mar 29, 2017 in Others Aman Chauhan 288 views
0 votes
1 answer
4
236 views
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-one For all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, if $g1 \neq g2$ implies $f \bigcirc g1 \neq f \bigcirc g2$ Where $\bigcirc$ is a fucntion composition.
asked Feb 17 in Set Theory & Algebra vivek_mishra 236 views
...