Answer Posted / hr@tgksolutions.com
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
Does arraylist have index?
Write a code for dynamic allocation of array.
Describe what is Node in link list? And name the types of Linked Lists?
What is the difference between static and dynamic data?
How do you use the sort function?
What is the slowest sorting algorithm?
What is a Stack? Explain with example?
Define the term “percolate down”?
Can an arraylist be null?
What is sort function?
What is a sorting algorithm in data structure?
What is huffman’s algorithm?
How can avl tree be useful in all the operations as compared to binary search tree?
Write a Program for Reverse a linked list.
What is the difference between arraylist and array?