Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit

(2) Self-study on a new data structure AND a new algorithm which are NOT covered in the course (50%)

As an introductory course, it is impossible for us to cover all the data structures and algorithms in one semester. Thus, your self-study will be essential to acquire broader knowledge about algorithm development.

In this course, we will introduce data structures like stack, queue, linked list, and binary search tree, and basic sorting algorithms, such as merge sort, selection sort, bubble sort, and pigeonhole sort. In this part, you are required to self-study one more data structure and one more algorithm (not limited to sorting). Here are possible choices:

a. Data structure: binary tree, graph, heap, matrix, etc.

b. Algorithm: heap sort, radix sort, shell sort, cocktail sort, etc. (you are not limited to sortingalgorithm)

To accomplish this part, each group (with 3 students for 2090SEF, 1 student for 8090SEF) is required to submit a study report to elaborate on the chosen topic. For your choice of data structure, you need to introduce the abstract data type (ADT) and the possible applications. For your choice of algorithms, you need to analyze the time complexity and give some examples of how the algorithm works.

If your report contains code snippets, a sufficient introduction and explanation are needed to show that you have a good understanding. Simply pasting the code into the report without any explanation will not be counted toward the grade. You are encouraged to insert diagrams and tables to illustrate your implementation and running results.