登录
首页 » Visual C++ » Phone-book

Phone-book

于 2015-03-09 发布 文件大小:2362KB
0 213
下载积分: 1 下载次数: 8

代码说明:

  数据结构课程设计 -电话本(运用了MFC图形化界面)(Curriculum design- the phone book)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • xx
    说明:  数据结构实验报告链表的操作,包括创建空链表、插入、删除节点等(Experimental Report list data structure operations, including creating an empty list, insert, delete nodes, etc.)
    2009-11-25 08:36:26下载
    积分:1
  • fiterVC051002116
    用VC++编写中值滤波的算法,具有图形界面(The algorithm of Filter ,which use VC++)
    2009-09-09 21:40:43下载
    积分:1
  • 0829-Binary-Tree
    二叉搜索树的生成和查找节点,北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)
    2012-11-28 14:51:01下载
    积分:1
  • min-dist
    图中计算最短路径,必须覆盖所有的节点,效率很高(to compute the shortest path in the graph)
    2012-01-06 00:03:33下载
    积分:1
  • bfs
    这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
    2013-12-05 15:56:50下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • Joseph
    说明:  约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
    2010-04-23 08:20:53下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • Task1-trial--10211281--zly
    描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: a) 俱乐部的增删改查,俱乐部的属性包括名称、现金、其下人员; b) 可以对所有球员的各项属性进行简单搜索,支持输入多个条件,条件之间用&&连接,例如: i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”,查询表达式:!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖,买卖需符合以下条件:作为买方的俱乐部的现金>=球员的转会费,交易完成后,卖方将得到转会费。 要求: d) 必须采用面向对象的方式,使用类组织数据结构,并注意类的继承关系; e) 在题目要求基础上可以自行扩展功能,提供扩实用扩展功能者适当加分(加分不超过5分)。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
    2013-08-20 10:09:29下载
    积分:1
  • PRIM
    PRIM算法 对任意给定的网和起点,用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)
    2009-01-11 19:05:21下载
    积分:1
  • 696516资源总数
  • 106579会员总数
  • 0今日下载