《數據結構》課程介紹
數據結構是計算機專業最重要的專業技術基礎課程和核心課程之一，是學生進一步深入學習和開展高層次研究的學科基礎必修課。計算機學院的數據結構課程不僅是伟德国际BETVlCTOR的名牌課程，而且在國内同行中産生了很大影響，享有較高知名度。數據結構課程被評為2003年度首批國家級精品課程。
數據結構課程内容具有如下特點：采用(ADL和C++)兩種語言描述算法；算法與數據結構緊密結合；強調“數學嚴格”，對書中典型算法都給出了時間複雜性分析，對與某些算法正确性相關的一些問題給出了證明，并注重分析與證明的嚴格性；突出啟發式教學與因材施教内容的設計與撰寫；對科研成果轉化為教學内容進行了探索；增加了與重要知識點相關的背景、曆史和參考文獻。
數據結構課程包括72學時的理論課、32學時的上機實驗課和36學時的課程設計。其中，理論課向學生講授數據結構的主要知識點，使學生掌握數據對象的特性、對所處理的數據對象選擇、構造合适數據結構和存儲結構的能力，進而掌握對這些數據進行操作的技術（各種算法）；同時培養學生利用算法語言和面向對象程序設計語言編寫結構清晰、正确易讀、高效的算法和程序的技巧和能力，以及對算法進行時空複雜性分析和算法正确性證明的基本方法。上機實驗重點培養學生設計算法、編制和調試程序的動手能力，課程設計着重培養學生綜合運用所學數據結構知識的能力。
數據結構課程系統介紹了數據結構的概念、原理與技術，主要内容包括：緒論，基本數據結構，排序、查找與内存管理，相關工具和文件。
數據結構課程内容的組織結構如下：第一章緒論主要介紹數據結構與算法的基本概念，算法描述語言與書寫規範，算法正确性證明與算法分析基礎；第二至第五章是基本數據結構部分，主要涉及線性表、堆棧與隊列，數組和字符串，樹與二叉樹，圖結構等内容；第七至第九章，從算法的視角讨論了排序、查找和内存管理等方面的内容，給出了若幹典型算法的描述，時間複雜性分析和相關算法的比較等；第六和第十一章分别對遞歸和随機數兩種主要工具進行了講解；文件，一種複雜數據結構，在第十章中被闡明。
The introduction of course ---Data Structures
Data structure is one of the most important fundamental courses for specialty of computer science and technology, it is essential for students to learn further and make academic research. The data structure course of College of Computer Science and Technology in Jilin University is not only a brand course, but also has significant impact on the domestic counterparts, and it has high reputation. This course was selected as the first batch of National Excellent Courses.
Data structure curriculum has the following features: using two languages (ADL and C++) to describe the algorithm; algorithms and data structures are tightly coupled; the typical algorithms are presented time complexity analysis, and the proof of the correctness for some issues about algorithms; exploring to introduce scientific research into teaching content; increased with the relevant background, history and references to important knowledge.
Data structures course includes 72 class hours for theory, 32 class hours for the experiment, and 36 class hours for curriculum design. The theory courses presents the main knowledge of the data structure; while training students to use algorithmic language and object-oriented programming language to develop clear, correct, easy to read, efficient algorithms and programs, as well as make analysis of space-time complexity for the algorithm and correctness proof for the algorithm. Experimental courses focus on training students to design algorithms, compile and debug the programs, curriculum design course emphasizes Comprehensive usage of of the data structure.
The course of data structure presents concepts, principles and techniques of data structure, the main contents include: Introduction, basic data structure, sorting, searching and memory management, related tools and files.
The course is organized as follows: The first chapter introduces the basic concepts of data structures and algorithms, algorithm description language and writing specifications, algorithm analysis and correctness proof; Chapter 2 to 5 are basic data structures, such as linear tables, stacks and queues, arrays and strings, trees and binary tree, graph structure, etc.; Chapter 7 to 9 discuss sorting algorithms, search and memory management and other aspects from the perspective of algorithm, present several typical algorithm, time complexity analysis and comparison of related algorithms; Chapter 6 and 11 present recursion and random number; Chapter 10 introduces a complex data structure: file.
