Answer Posted / glibwaresoftsolutions
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
Which sorting method is slowest?
List out the basic operations that can be performed on a stack?
What are the types of collision resolution strategies in open addressing?
Does treemap allow duplicate keys?
Which sorting is best?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
What is difference between linear and non linear data structure?
What are hashmaps good for?
Explain the steps to insert data into a singly linked list?
Explain the uses of binary tree.
Differentiate between arraylist and vector.
What is data structure and its types?
What are the types of queues?
What is a subtree in data structures?
What is a treeset?