登录
首页 » Visual C++ » tcpip

tcpip

于 2013-03-26 发布 文件大小:5KB
0 184
下载积分: 1 下载次数: 1

代码说明:

  以太网首部的一个c语言程序,代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

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

发表评论

0 个回复

  • maze
    通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
    2010-09-02 21:43:32下载
    积分:1
  • 最小生成树
    给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
    2017-06-05 17:27:17下载
    积分:1
  • arc
    运用二叉树求代数表达式的值,将代数表达式的每个符号用二叉树结点表示,遍历图的每一结点,按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
    2012-06-23 19:52:38下载
    积分:1
  • DisplayBTree
    代码注重B树插入、删除的算法逻辑,适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
    2006-07-19 00:00:38下载
    积分:1
  • delete
    数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
    2012-11-14 12:59:15下载
    积分:1
  • 005
    c++ data struct stack
    2012-03-01 14:24:42下载
    积分:1
  • stack-link
    简单的一个链栈.即用链表实现的一个栈。可以做简单的插入、删除、查找等操作(this is a simple C++ program )
    2014-05-28 20:12:28下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • moni
    数据结构 银行模拟问题 (Bank of simulation data structure problem)
    2011-01-04 21:08:10下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载