Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / nashiinformaticssolutions
A specific kind of data structure that has a collection of ordered pairings is called a graph.
Another name for the ordered pairs in a graph is arcs or edges. Connecting nodes where data can be stored and accessed is their most popular use.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Is it possible to increase size of array?
What is the difference between hashset and hashmap?
What is stable sort?
Are sets sorted?
Does hashmap allow duplicate keys?
Advanced problems related to Data Structures were asked
Define 2-3 tree?
What happens if we put duplicate key in hashmap?
Define quadratic probing?
Explain pre-order and in-order tree traversal.
How do you represent a linked list?
Why set will not allow duplicates?
What is the use of prototype?
Why quicksort is faster than merge sort?
Mention one advantage and disadvantage of using quadratic probing?
