Academics
-
Schools
- School of Law
- School of Business Administration
- School of Accounting
- School of Finance
- School of Economics
- School of Public Finance and Taxation
- School of Humanities and Communication
- School of Information Science
- School of Public Administration
- School of Art and Design
- School of Foreign Studies
- School of Geography and Tourism
- School of Statistics and Mathematics
- School of Greater Bay Area Film and Television Industry
- International School
- International Business School
- Cultural Creativity and Tourism School
- School of Digital Economy
- Undergraduate Education
- Postgraduate Education
Data Structures
Release Date: 2017-09-221. Basic Course Information
Course Code: 110104
Course Name: Data Structures
Course Type: Fundamental Course
Periods: 64
Credits: 4
Target Students: Underground Majoring in Information Science
Assessment: Examination
Preparatory Courses: Program Design
2. Course Introduction
"Data Structures" is a major foundation course in computer science and technology major. This course can enable students to master a variety of basic data structures and basic operations and algorithms on data structures, and high-level language algorithms can be applied for the study of software algorithms in future practical engineering.
This course introduces common data representation and processing technologies, including sequence storage and linked storage of the linear list; the concept and storage structures and basic operations and applications of stack and queue, and implementation of recursive algorithms; several storage representation of string; definition and storage structures of generalized list; definition and nature and storage structure of binary tree, binary tree traversal and threaded binary tree, search tree, balanced binary tree, conversion between trees and forests and binary tree, Huffman tree with Huffman coding; storage structure of graph, graph traversal, minimum spanning tree, topological sort, the critical path, the shortest path; static and dynamic lookup table, structure and conflict of hash table; internal sorting methods such as insertion sort , quick sort, selection sort, merge sort, etc., comparison within a few sort.