文件名称:
Data.Structure.Practice.for.Collegiate.Programming.Contests.and.Education
开发工具:
文件大小: 12mb
下载次数: 0
上传时间: 2016-02-23
详细说明： Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students in computer-related majors to gain deeper understanding of data structure. Based on successful experiences in many world-level contests, the book includes 204 typical problems and detailed analyses selec ted from the ACM International Collegiate Programming Contest and other major programming contests since 1990. It is divided into four sections that focus on: Fundamental programming skills Experiments for linear lists Experiments for trees Experiments for graphs Each chapter contains a set of problems and includes hints. The book also provides test data for most problems as well as sources and IDs for online judgments that help with improving programming skills. Introducing a multi-options model and considerations of context, Data Structure Practice for Collegiate Programming Contests and Education encourages students to think creatively in solving programming problems. By taking readers through practical contest problems from analysis to implementation, it provides a complete source for enhancing understanding and polishing skills in programming. Table of Contents Section I: Fundamental Programming Skills Chapter 1: Practice for Simple Computing Chapter 2: Simple Simulation Chapter 3: Simple Recursion Section II: Experiments for Linear Lists Chapter 4: Linear Lists Accessed Directly Chapter 5: Applications of Linear Lists for Sequential Access Chapter 6: Generalized List Using Indexes Chapter 7: Sort of Linear Lists Section III: Experiments for Trees Chapter 8: Programming by Tree Structure Chapter 9: Applications of Binary Trees Chapter 10: Applications of Classical Trees Section IV: Experiments for Graphs Chapter 11: Applications of Graph Traversal Chapter 12: Algorithms of Minimum Spanning Trees Chapter 13: Algorithms of Best Paths Chapter 14: Algorithms of Bipartite Graphs and Flow Networks ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
