edited by
351 views
0 votes
0 votes

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.

edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
sripo asked Feb 15, 2019
411 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.
0 votes
0 votes
0 answers
3
Aman Chauhan asked Mar 29, 2017
680 views
CSE- Jest exam rank-143 part -1 paper any chance of colleges
0 votes
0 votes
0 answers
4
Priyangshu_AIR__ asked Apr 25, 2023
88 views
Anyone received any mail regarding JEST 2023 result for Theoretical Computer Science?