small things to jointly build a socialist harmonious society要求：(1)Tomasterthebasicconceptsandterminologyofdata structures(2)To master abstract data type(3)Tolearn howtoanalyzealgorithms第2章Arrays重点：Basic Operations of Array难点：Abstract Data TypeforPolynomial教学方法与手段：Withteaching as the main part and self-learning networkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification.内容：(1)Basic Concepts of Linear List(2)Basic Operations on Arrays(3)PolynomialCourse ideology and politics:When introducing the contents of sections 1 and 2, since differentstorage methods of lineartables havetheirown advantages and disadvantages,specific problems shouldbe analyzed in detail.Each person also has his own unique flash point. He must find the right position, dowhat he is best at, explore the infinite potential, and open the chapter of life.要求：(I)To master the data structure of linear list(2)Tomasterthesequential representationandimplementationoflinearlist(3)Tounderstand therepresentationand implementationof univariatepolynomial第3章LinkList重点:Basic Operations of a SinglyLinked List难点：Definition of a DoublyLinked List教学方法与手段：With teaching as the main part and self-learning networkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification.内容：(1)ConceptofaSinglyLinked List
small things to jointly build a socialist harmonious society. 要求： (1)To master the basic concepts and terminology of data structures (2)To master abstract data type (3)To learn how to analyze algorithms 第 2 章 Arrays 内容： (1)Basic Concepts of Linear List (2)Basic Operations on Arrays (3)Polynomial Course ideology and politics：When introducing the contents of sections 1 and 2, since different storage methods of linear tables have their own advantages and disadvantages, specific problems should be analyzed in detail. Each person also has his own unique flash point. He must find the right position, do what he is best at, explore the infinite potential, and open the chapter of life. 要求： (1)To master the data structure of linear list (2)To master the sequential representation and implementation of linear list (3)To understand the representation and implementation of univariate polynomial 重点：Basic Operations of Array 难点：Abstract Data Type for Polynomial 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification. 第 3 章 Link List 内容： (1)Concept of a Singly Linked List 重点：Basic Operations of a Singly Linked List 难点：Definition of a Doubly Linked List 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification
(2)Concept of a Doubly Linked ListCourse ideology and politics:When introducing the contents of section 1, the importance of thehead pointer is introduced. The head pointer is like a lighthouse, illuminating the direction of life for us,guiding students to play an exemplary and leading role in the collective, so that they can understand thatthe development of the country and the progress of society are inseparable from the efforts of everyone,so as to stimulate students to transmit positive energy.要求：(1)To master the operation of a singly linked list(2)Tounderstand the operation ofa doubly linked list第4章Stacks andQueues重点:Basic Operations andApplicationsof Stacks and Queues难点：CircularQueue教学方法与手段：Withteaching as the main part and self-learning networkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification, further deepeningunderstandingknowledge through after-school practice.内容：(1)Definition and Basic Operations of Sequential Stack(2)Definition of Linked Stack(3)DefinitionandBasicOperationsofCircularQueue(4)DefinitionandBasicOperationsofLinkedQueueCourse ideology and politics:When introducing the contents of sections 3 and 4, the students areguided ideologically and politically through common queuing examples, and the importance of abidingby social order and social morality is extended.The students are educated to abide by discipline and lawand then the students are educated about"freedom, equality,justice and the rule of law" in the socialiscorevalues要求：(1)Tomasterthedefinition andbasicoperations ofstack(2)To understand the definition of linked stack and related operations(3)To master the definition and basic operations of queque第5章Tree
(2)Concept of a Doubly Linked List Course ideology and politics：When introducing the contents of section 1, the importance of the head pointer is introduced. The head pointer is like a lighthouse, illuminating the direction of life for us, guiding students to play an exemplary and leading role in the collective, so that they can understand that the development of the country and the progress of society are inseparable from the efforts of everyone, so as to stimulate students to transmit positive energy. 要求： (1)To master the operation of a singly linked list (2)To understand the operation of a doubly linked list 第 4 章 Stacks and Queues 内容： (1)Definition and Basic Operations of Sequential Stack (2)Definition of Linked Stack (3)Definition and Basic Operations of Circular Queue (4)Definition and Basic Operations of Linked Queue Course ideology and politics：When introducing the contents of sections 3 and 4, the students are guided ideologically and politically through common queuing examples, and the importance of abiding by social order and social morality is extended. The students are educated to abide by discipline and law, and then the students are educated about "freedom, equality, justice and the rule of law" in the socialist core values. 要求： (1)To master the definition and basic operations of stack (2)To understand the definition of linked stack and related operations (3)To master the definition and basic operations of queque 重点：Basic Operations and Applications of Stacks and Queues 难点：Circular Queue 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification, further deepening understanding knowledge through after-school practice. 第 5 章 Tree
重点：Concept and Operation of BinaryTree难点：BinaryTreeTraversalAlgorithm,Heap,BinarySearchTree教学方法与手段：Withteachingasthemainpartand self-learningnetworkresources as thesupplement,heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification, further deepeningunderstandingknowledge through after-school practice.内容：(1)Definition and Basic Terminology of Tree(2)Definition andPropertiesof BinaryTree(3)TraverseBinaryTree(4)DefinitionandOperation of MaxHeap(5)Definition and Basic Operations of Binary Search Tree(6)DefinitionofForestand ConversiontoBinaryTreeCourse ideology and politics:When introducing the contents of section 1, the concept of familyand genealogy is extended according to the characteristics of tree structure, explaining Chinesegenealogy culture to students, encouraging students to learn and inherit Chinese excellent traditionalculture,atthe sametime educating studentstolovethe partylovethe country,lovethefamilyand lovethe school. While building the motherland, they should also pay attention to the development of theirhometown,要求：(1)Tomasterdefinitionandbasicterminologyoftree(2)Tomaster definition and properties of binary tree(3)Tomasterbinary treetraversals(4)Tomasterdefinition of max heap,aswell as insertanddeleteoperations(5)Tomasterdefinitionandoperations ofbinarysearchtree(6)Tounderstandtheconceptofforest第6章Graph重点：DFSandBFSAlgorithmsforGraphs难点：MinimumCostSpanningTree,ShortestPath教学方法与手段：Withteachingasthemainpartandself-learningnetworkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification, furthermorestudents aresupposed tocompletehomeworkafterclass
内容： (1)Definition and Basic Terminology of Tree (2)Definition and Properties of Binary Tree (3)Traverse Binary Tree (4)Definition and Operation of Max Heap (5)Definition and Basic Operations of Binary Search Tree (6)Definition of Forest and Conversion to Binary Tree Course ideology and politics：When introducing the contents of section 1, the concept of family and genealogy is extended according to the characteristics of tree structure, explaining Chinese genealogy culture to students, encouraging students to learn and inherit Chinese excellent traditional culture, at the same time educating students to love the party, love the country, love the family and love the school. While building the motherland, they should also pay attention to the development of their hometown. 要求： (1)To master definition and basic terminology of tree (2)To master definition and properties of binary tree (3)To master binary tree traversals (4)To master definition of max heap, as well as insert and delete operations (5)To master definition and operations of binary search tree (6)To understand the concept of forest 重点：Concept and Operation of Binary Tree 难点：Binary Tree Traversal Algorithm, Heap, Binary Search Tree 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification, further deepening understanding knowledge through after-school practice. 第 6 章 Graph 重点：DFS and BFS Algorithms for Graphs 难点：Minimum Cost Spanning Tree, Shortest Path 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification, furthermore students are supposed to complete homework after class
内容：(1)Definition and Terminology of Graph(2)Graph Representation and Traversal(3)GraphConnectivity(4)MinimumCostSpanningTree(5)Shortest PathCourseideologyand politics:When introducingthe content of Section 1,one oftheapplications ofgraphs is mentioned as artificial intelligence, the development of artificial intelligence is introduced, andstudents are guided to pay attention to the cultivation of scientific spirit and the spirit of craftsmen ofagreat country, and implement them into actions, and strive to learn scientific and cultural knowledge, aswell as train scientific literacy such as persistence, focus, excellence, dedication and trustworthiness, andinnovation要求：(1)To master the definition and terminology of graph(2)To master the storage structure of graph(3)To master the traversal algorithm ofgraph(4)To understand graph connectivity(5)To understand minimum cost spanning tree(6)To understand shortest path第7章Sorting重点：InsertionSort，Swap Sort难点：HeapSort,QuickSort教学方法与手段：Withteaching as themainpartand self-learning networkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discuss with students, and theoretical mastery isdeepened by means of experimental programming verification, furthermorestudents are supposed to complete homework after class.内容：(1)Overview of the Sorting Method(2)Insertion Sort (Straight Insertion Sort, Binary Insertion Sort, Shell Sort)(3)Swap Sort (Bubble sort, Quick sort)(4)Selection Sort (Simple Selection Sort, Tree Selection Sort, Heap Sort)(5)Merge SortCourseideologyandpolitics:When introducing the contentsof section 4,the common tournament
内容： (1)Definition and Terminology of Graph (2)Graph Representation and Traversal (3)Graph Connectivity (4)Minimum Cost Spanning Tree (5)Shortest Path Course ideology and politics：When introducing the content of Section 1, one of the applications of graphs is mentioned as artificial intelligence, the development of artificial intelligence is introduced, and students are guided to pay attention to the cultivation of scientific spirit and the spirit of craftsmen of a great country, and implement them into actions, and strive to learn scientific and cultural knowledge, as well as train scientific literacy such as persistence, focus, excellence, dedication and trustworthiness, and innovation. 要求： (1)To master the definition and terminology of graph (2)To master the storage structure of graph (3)To master the traversal algorithm of graph (4)To understand graph connectivity (5)To understand minimum cost spanning tree (6)To understand shortest path 第 7 章 Sorting 内容： (1)Overview of the Sorting Method (2)Insertion Sort (Straight Insertion Sort, Binary Insertion Sort, Shell Sort) (3)Swap Sort (Bubble sort, Quick sort) (4)Selection Sort (Simple Selection Sort, Tree Selection Sort, Heap Sort) (5)Merge Sort Course ideology and politics：When introducing the contents of section 4, the common tournament 重点：Insertion Sort, Swap Sort 难点：Heap Sort, Quick Sort 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students, and theoretical mastery is deepened by means of experimental programming verification, furthermore students are supposed to complete homework after class
ranking is used as the introduction. According to the promotion rules of the championship, thecompetition is faced and the fittest is eliminated. Only by being the best can we bravely climb the peak oflife inthecruel social competition要求：(1)Tounderstand the sortingmethod(2)To master insertion sort (straight insertion sort, binary insertion sort,shell sort)(3)To master swap sort(bubble sort, quick sort)(4)Tomaster selection sort (simple selection sort, tree selection sort, heap sort)(5)To understand merge sort第8章Search重点：StaticSearch,DynamicSearch难点：Hash教学方法与手段：Withteachingasthemainpartandself-learningnetworkresources as the supplement, heuristic and case-based teaching methods areadopted to interact and discusswith students.内容：(1)Static Search Table(2)Dynamic SearchTable(3)Hash tableCourse ideology and politics:When introducing the contents of section 1, we will explain thesearch algorithms under different storage methods, and guide students to establish a good outlook onlove. When looking for love, we should find a suitable person.要求：(1)To understand static search table(2)To understand dynamic search table(3)Tomastertheconstructionofhashtable六、学时分配教学内容各教学环节学时分配作业题备注讲实讨习课其小量章节主要内容授验论题外计它
ranking is used as the introduction. According to the promotion rules of the championship, the competition is faced and the fittest is eliminated. Only by being the best can we bravely climb the peak of life in the cruel social competition. 要求： (1)To understand the sorting method (2)To master insertion sort (straight insertion sort, binary insertion sort,shell sort) (3)To master swap sort(bubble sort, quick sort) (4)To master selection sort (simple selection sort, tree selection sort, heap sort) (5)To understand merge sort 第 8 章 Search 内容： (1)Static Search Table (2)Dynamic Search Table (3)Hash table Course ideology and politics ： When introducing the contents of section 1, we will explain the search algorithms under different storage methods, and guide students to establish a good outlook on love. When looking for love, we should find a suitable person. 要求： (1)To understand static search table (2)To understand dynamic search table (3)To master the construction of hash table 重点：Static Search, Dynamic Search 难点：Hash 教学方法与手段：With teaching as the main part and self-learning network resources as the supplement, heuristic and case-based teaching methods are adopted to interact and discuss with students. 六、学时分配 教学内容 各教学环节学时分配 作业题 量 备注 章节 主要内容 讲 授 实 验 讨 论 习 题 课 外 其 它 小 计