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
What is the minimization factor and time complexity of b-tree?
Does list maintain insertion order?
Define distributed query and linked server?
What do you mean by Logical Error
What does sorting an array do?
Define double linked list?
How can we reverse the order in the treemap?
How do you sort a collection in descending order?
How do hash tables work?
What is collection sort?
What is static array?
Which algorithm is used in collections sort method?
Describe stack operation.
Can hashmap be sorted?
What do you mean by secondary clustering?