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
What is data structure operations?
What is a data structure definition?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
What are the advantages of merge sort?
Write a program to reverse a link list.
How many types of linked list are there?
Can list contain null values?
What is the difference between hashset and hashmap?
Define collision in hashing?
What do you mean by primary clustering?
Can hashset contain null?
Which sorting is best and why?
Can you sort a hashset?
Does hashmap allow duplicate keys?
What is difference between arraylist and list?