vs_course's Introduction

Basic computer science courses

Data Structure, 2018 spring

Chapter 1 List

SqList, sequencial list
LinkNode, linked list, circular linked list
DLinkNode, double linked list

Chapter 2 Stack

SqStack, sequencial stack
Examples: symmetry string, post expression, mg_path (pp. 93)

LinkStNode, linked stack
Examples: judge a pair of brackets

Chapter 3 Queue

SqQueue, sequencial queue, circular queue
LinkQueueNode, linked queue

Chapter 4 String

SqString,  Brute-Force, KMP
LinkString

Chapter 5 Tree

BTNode
Binary tree, threaded tree, construct a binary tree, Huffman tree

Chapter 6 Graph

Adjacency matrix, adjacency list
Traverse of graphs
Spanning tree£¬ minimum spanning
Optimal path, topological sort

Chapter 7 Search

Lookup linear table
Lookup tree table
Find a hash table

Chapter 8 InternalSort

Insertion sort

C Programming Language, 2020 spring

Chapter 3 Branches

- Guesse number
- Water charge
- Is Odd / Even number?
- Logical operations
- If / else
- Switch

Chapter 4 Loops

- Introduce *char* data type
- Decompose an interger to numbers using *recursive* function
- Decompose an interger to numbers using *do {} while ();* structure
- Factorial number using *for* structure

Some suggestions for beginners

- Get a blank paper, and a pen, write down the logical structure.
- Prepare examples for each data structure, details examples please see header files. start at main function.
- Try more exercise and be skilled on those data structure.