# 数据结构

## 课程内容 <a href="#ke-cheng-nei-rong" id="ke-cheng-nei-rong"></a>

主要是介绍常用的各种数据结构，如线性表、栈、队列、串、数组和广义表，树，图，查找等等，并且还需要对算法的时间和空间复杂度有分析能力，课程内容并不难，也没有很难理解的算法，但是课本给出的伪代码是类 C，一些语法是 C++ 中的，没接触过C++的同学可以自己了解一下或者上课着重听老师讲一下这方面。

## 作业实验 <a href="#zuo-ye-shi-yan" id="zuo-ye-shi-yan"></a>

作业大概都是数据结构习题集，代码编写题仍旧需要手搓代码（部分班级）；实验每个班要求都不太一样（去年笔者选的班甚至还需要交实验报告），不过难度参考pksq应该都不是特别大，只要认真写都不会扣太多分。

## 考试 <a href="#kao-shi" id="kao-shi"></a>

期末统考，题型大致是：选择、填空、简答、算法，难度不大，pksq能找到一些往年题，考前可以看看熟悉一下题型，或者做一下数据结构习题集熟练伪代码的书写。


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://advancedguideforsds.gitbook.io/advancedguide/jin-jie-pian/shu-qi-jing-yan-wen-dang/ke-cheng-xue-xi/shu-ju-jie-gou.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.
