DP

江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

说明：  进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目21存成的资源分配图的文件作为输入；  编写资源分配图化简算法；  每化简一步，在屏幕上显示化简的当前结果；  最后给出结论，是否死锁，如思索给出死锁的进程及资源； (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )

多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)

Dijlstra算法 对任意图，选择合适的数据结构表示图，在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)

自己用c语言写的一个模块化多电平最近电平调制排序的c程序，希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)