State the different properties of fuzzy set.

Please help me with the Runtime/ Space performance/complexity of those data structures. Please include the Best case, Average case, and Worst case scenario of adding/removing, deleting/inserting at the beginning, middle, and end, including searching and sorting, and their definition/properties. Graphs in general Types and properties (un/connected, un/weighted, un/directed, bipartite, fully connected,) Ways to store graphs/graph data (adjacency list, matrix, ) Graph algorithms Searching (DFS, BFS, Best First or A*) Minimum Spanning Trees (Prim's, Kruskal) Shortest Path (Dijkstra) thank you

The benefits and disadvantages of weighted graphs against adjacency lists should be compared.

Write your own example of a set P containing 5 ordered pairs (x, y) such that P is not a function.

Define an array and a linked list in the context of data structures.

In computer science, how is duality leveraged when studying data structures like trees and their dual representations?

Does the usage of linear data structures still have a place in the modern world? Give an example to back up your statement.

The benefits and disadvantages of weighted graphs against adjacency lists should be compared.

You could save the names of restaurants together with their x, y locations in a database. Just think about the following questions: The primary concern of the inquiry is to determine whether a dining establishment exists. Optimal approach to indexing: Which is better, a B-tree or an R-tree? Why?

in java