Hello guys. I have to report this week for my Data structure. I need help to sho

Question

Hello guys. I have to report this week for my Data structure. I need help to shorten my brief summary and I also need your idea . thank you

a.)A brief description of the algorithm or data structure

-What makes this data structure or algorithm unique in its class?

-What are the constraints or characteristics that must be preserved when implementing, creating, or modifying this data structure or algorithm?

-Are there any variations that improve the data structure of algorithm?

b.)What are the worst case, average, and best case scenarios? Finds, Deletes, Create, Inserts, etc.

c.)What is the (O) notation and why? (Be able to briefly explain this)

d.)Two examples of where this data structure or algorithm could be used in the world or development setting.

==================================================================================

1.)Linked Lists

2.)Stacks

3.)Queues

4.)O(n2) Sorting Algorithms: Selection, Insertion, and Bubble Sort

5.)O(nlogn) Sorting Algorithms: MergeSort and QuickSort

6.)Tries

7.)Binary Trees:BST and AVL

8.)DFS/BFS Graphs

9.)Dijkstra Algorithm and Bellman Ford Algorithm

10.)Huffman Coding

11.)Hashing

12.)Heaps

13.)Priority Queues

14.)Disjoint Sets

15)Minimum Spanning Tree

Explanation / Answer

a)Data structures:It is basically a way of organization of data .So, that it can be used more efficiently.It is used to store data in a organized.So, that algorithms can be used on it.It is the sorting of data in a effifcient way.Sorting is done as per the purpose of the user.After organizing logical operations can be performed efficiently on the data.

b)worst case,average and best case: worst case: it is the maximum amount of steps to achieve a certain goal.It is least efficient. average case:It is the average amount of steps taken to achieve a certain goal.best case: least number of steps taken to achieve certain goal.It is the most important case.

c)big (O)notation:It is generally used to describe worst case scenario and it is also used to find out the execution time or the space required by the logical operation or the algorithm.

d)two examples:it is used in programming languages like java for organization of data.Real life examples:In storing customer information at shopping outlets.moves of chess etc...

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.