Students will understand the basic concepts and terminology of data structures and be able to manipulate linear lists, linked lists, stacks and queues. They will learn how to use compressed storage methods for special matrices and compressed matrices and manipulate sparse matrices. They will employ graph structures and algorithms and various sorting methods in real world problems.
1. Understand the basic concepts and terminology of data structures and the basic concepts and characteristics of algorithms (1.1 Data Structures Xidian CS263004X)
2. Manipulate linear lists, linked lists, stacks and queues and understand two types of storage structures for stacks and queues and their description methods. (2.1 Data Structures Xidian CS263004X)
3. Use compressed storage methods for special matrices and compressed matrices, the transposition algorithm under the sparse matrix sequential triple table representation (3.1 Data Structures Xidian CS263004X)
4. Understand the logical and physical structures of trees, and the conversion of trees, forests, and binary trees, along with the logical definition of graph structures. (4.1 Data Structures Xidian CS263004X)
5. Employ the preferential traversal methods and algorithms for graphs, the organization and search methods of sequential tables, the numerical tables and their search methods, hash table search methods, and various external and internal sorting algorithms. (5.1 Data Structures Xidian CS263004X)
By the end of the course, students should be able to do the following:
Curriculum explorer: Click here
SCQF Level: 8
Credits: 15