|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/data-structures-stack-queue-linkedlist/
课程评论：没有评论
课程名称：使用C语言的基本数据结构与算法 课程概述： 本课程旨在帮助学生掌握使用C编程语言的数据结构和算法知识。数据结构和算法的知识在提升编程技能方面至关重要。课程内容基于全球多所大学的研究生工程和计算机应用课程标准大纲。学生将通过逐步开发概念，学习如何编写算法以及基于这些算法编写程序。 课程内容包括（全部使用C语言实现）： 1. 数据结构的基本概念 2. 数据结构的必要性 3. 栈：概念、定义、算法及实现。使用栈进行括号检测、波兰表示法、由中缀表达式转换为后缀表达式及其评估。 4. FIFO队列：概念、定义、算法及实现。 5. 循环队列（使用数组）：概念、定义、算法及实现。 6. 双端队列（使用数组）：概念、定义、算法及实现。 7. 链表：概念、定义、链表的必要性及与数组的比较。 8. 单链表：各类操作的算法开发及实施。 9. 使用单链表创建栈和队列的实现。 10. 双链表：各种操作的概念、定义及算法的实现。 11. 循环链表：概念、定义、算法及实现。 12. 算法效率的计算，最坏情况（大O）、平均情况（大Θ）和最好情况（大Ω）的复杂度及如何计算不同算法的复杂度。 13. 二分搜索。 14. 递归的详细讲解，使用递归的示例程序及递归方法与迭代方法的关键比较。 15. 二叉树的定义、遍历（中序、前序和后序）、二叉搜索树的实现。 16. 堆数据结构：定义、堆插入、删除、堆调整、堆化及堆排序。 本课程适合希望通过C语言深入了解数据结构与算法的学生。
This course will help the students ability to grasp the knowledge of data structures and algorithm using the C programming language. Knowledge of Data Structures and Algorithms are essential in developing better programming skills. This course is based on the standard curriculum of Universities across the globe for graduate level engineering and computer application course. Apart from step by step development of concepts students will also learn how to write algorithms and then how to write programs based on the algorithms in this course. You will learn the following in this course: (All implemented using C programming)Fundamental of Data Structure conceptWhy we need Data StructuresStack - Idea, definition, algorithm, implementations.Using Stack - Parenthesis checking, Polish Notation, Infix to postfix conversion and evaluation.FIFO Queue - Idea, definition, algorithm, implementation.Circular Queue using array - Idea, definition, algorithm, implementation.Double ended queue using array - Idea, definition, algorithm, implementation.Linked List - Idea, definition, why we need linked list. Comparison with array.Singly Linked List - Development of algorithm for various operations and then Implementation of each of themCreating Stack and Queue using Singly Linked list - Implementation.Doubly Linked List - Idea, definition, algorithm of various operations and implementations.Circular Linked List - Idea, definition, algorithm and implementations.14. Calculating efficiency of algorithms, Worst Case (Big Oh), Average Case (Big Theta) and Best case (Big omega) complexities. How to calculate them for different algorithms.15. Binary Searching16. Recursion in detail. Example program using recursion and the critical comparison between Recursive approach and Iterative approach of problem solving. 17. Binary Tree, definition, traversal (In, Pre and Post Order), Binary Search Tree implementation. 18. Heap data structure, definition, heap insertion, deletion, heap adjust, Heapify and heap sort.
