exercises

C++ Exercises（十六）---Ethernet帧包结构解析

图1是一个假想的帧包结构， 图2是解包后的结果。  /////////////////////////////  ///帧信息类   /////////////////////////////  class CFrame  {  public:      CFrame(void);      ~CFrame(void);      void setSeri
phinecos·2009-01-03 16:00

C++ Exercises（十六）---Ethernet帧包结构解析

图1是一个假想的帧包结构， 图2是解包后的结果。  /////////////////////////////  ///帧信息类   /////////////////////////////  class CFrame  {  public:      CFrame(void);      ~CFrame(void);      void setSeri
phinecos·2009-01-03 16:00

ip prefix-list 属性

Exercises:1.Constructaprefixlistthatpermitsonlythe192.168.1.0/24network.ipprefix-listtest1seq5permit192.168.1.0
steveguo2007·2008-12-16 22:42

ip prefix-list 属性

Exercises:1.Constructaprefixlistthatpermitsonlythe192.168.1.0/24network.ipprefix-listtest1seq5permit192.168.1.0
steveguo2007·2008-12-16 22:42

关于优先局部变量

public class Exercises11 { public static void main(String[] args){ AllTheColorsOfTheRainbow atc
michelecindy·2008-06-06 09:00

WAS 控制台 命令 脚本 jacl代码参考

jacl代码参考转载请标明出处http://blog.csdn.net/keyboardsunhttp://www.chinacsharp.netkeyboardsunAppendixA:Exercises
keyboardsun·2008-02-19 09:00

WAS 控制台 命令 脚本 jacl代码参考

jacl代码参考 转载请标明出处http://blog.csdn.net/keyboardsun http://www.chinacsharp.net keyboardsun Appendix A: Exercises
keyboardsun·2008-02-19 09:00

C++ Exercises（七）

Dll的示例代码namespace MathFuncs{    class MyMathFuncs    {    public:        // Returns a + b        static __declspec(dllexport) double Add(double a, double b);        // Returns a - b        static __de
phinecos·2007-11-16 17:00

Ip prefix-list知多少？

Exercises:1.Constructaprefixlistthatpermitsonlythe192.168.1.0/24network.ipprefix-listtest1seq5permit192.168.1.0
kendy·2007-08-30 01:43

Ip prefix-list知多少？

Exercises:1.Constructaprefixlistthatpermitsonlythe192.168.1.0/24network.ipprefix-listtest1seq5permit192.168.1.0
kendy·2007-08-30 01:43

Ip prefix-list知多少？

Exercises:1.Constructaprefixlistthatpermitsonlythe192.168.1.0/24network.ipprefix-listtest1seq5permit192.168.1.0
kendy·2007-08-30 01:43

数据结构与算法分析课后习题第三章(3)

Exercises3.3ImplementtheSTLfindroutinethatreturnstheiteratorcontainingthefirstoccurrenceofxintherangethatbeginsatstartandextendsuptobutnotincludeend.Ifxisnotfound
zybzmhhj·2007-03-02 21:00

Enterprise Library 2.0 Hands On Lab 翻译（15）：加密应用程序块（二）

第一步打BugSmak.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Cryptography\exercises
lihuijun·2006-10-16 23:00

Enterprise Library 2.0 Hands On Lab 翻译（14）：加密应用程序块（一）

第一步打BugSmak.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Cryptography\exercises
lihuijun·2006-10-16 22:00

Enterprise Library 2.0 Hands On Lab 翻译（13）：安全应用程序块（二）

第一步打BugSmak.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Security\exercises
lihuijun·2006-10-14 23:00

Enterprise Library 2.0 Hands On Lab 翻译（12）：安全应用程序块（一）

第一步打BugSmak.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Security\exercises
lihuijun·2006-10-09 22:00

Enterprise Library 2.0 Hands On Lab 翻译（11）：缓存应用程序块（三）

EmployeeBrowser.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Caching\exercises
lihuijun·2006-10-09 22:00

Enterprise Library 2.0 Hands On Lab 翻译（10）：缓存应用程序块（二）

EmployeeBrowser.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Caching\exercises
lihuijun·2006-10-09 00:00

Enterprise Library 2.0 Hands On Lab 翻译（9）：缓存应用程序块（一）

EmployeeBrowser.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Caching\exercises
lihuijun·2006-10-09 00:00

Enterprise Library 2.0 Hands On Lab 翻译（8）：异常应用程序块（二）

Puzzler2.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\ExceptionHandling\exercises
lihuijun·2006-10-07 11:00

Enterprise Library 2.0 Hands On Lab 翻译（7）：异常应用程序块（一）

Puzzler.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\ExceptionHandling\exercises
lihuijun·2006-10-07 00:00

Enterprise Library 2.0 Hands On Lab 翻译（6）：日志应用程序块（三）

第一步打开EnoughPI.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\Logging\exercises
lihuijun·2006-10-06 17:00

Enterprise Library 2.0 Hands On Lab 翻译（3）：数据访问程序块（三）

第一步打开DataEx3.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\DataAccess\exercises
lihuijun·2006-10-06 12:00

Enterprise Library 2.0 Hands On Lab 翻译（2）：数据访问程序块（二）

第一步打开DataEx2.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\DataAccess\exercises
lihuijun·2006-10-06 12:00

Enterprise Library 2.0 Hands On Lab 翻译（1）：数据访问程序块（一）

SimpleData.sln项目，默认的安装路径应该为C:\ProgramFiles\MicrosoftEnterpriseLibraryJanuary2006\labs\cs\DataAccess\exercises
lihuijun·2006-10-06 12:00

算法导论习题Exercises 14.2-5

Exercises14.2-5:⋆Wewishtoaugmentred-blacktreeswithanoperationRB-ENUMERATE(x,a,b)thatoutputsallthekeysksuchthata
pennyliang·2006-09-17 09:00

算法导论习题Exercises 14.2-5

Exercises14.2-5:⋆Wewishtoaugmentred-blacktreeswithanoperationRB-ENUMERATE(x,a,b)thatoutputsallthekeysksuchthata
isiqi·2006-09-17 09:00

算法导论[Exercises 14.2-4]

Exercises14.2-4:⋆Let*beanassociativebinaryoperator,andletabeafieldmaintainedineachnodeofared-blacktree.Supposethatwewanttoincludeineachnodexanadditionalfieldfsuchthatf
pennyliang·2006-09-17 09:00

算法导论[Exercises 14.2-4]

Exercises14.2-4:⋆Let*beanassociativebinaryoperator,andletabeafieldmaintainedineachnodeofared-blacktree.Supposethatwewanttoincludeineachnodexanadditionalfieldfsuchthatf
isiqi·2006-09-17 09:00

算法导论习题14.1-7

Exercises14.1-7Showhowtouseanorder-statistictreetocountthenumberofinversions(seeProblem2-4)inanarrayofsizenintimeO
isiqi·2006-09-17 09:00

算法导论习题14.1-7

Exercises14.1-7Showhowtouseanorder-statistictreetocountthenumberofinversions(seeProblem2-4)inanarrayofsizenintimeO
pennyliang·2006-09-17 09:00

算法导论[Exercises 9.3-8 ]

Exercises 9.3-8 Let X[1 .. n] and Y [1 .. n] be two arrays, each containing n numbers already in sorted
isiqi·2006-09-06 21:00

算法导论习题[Exercises 32.1-3 ]

SupposethatpatternPandtextTarerandomlychosenstringsoflengthmandn,respectively,fromthed-aryalphabetΣd={0,1,...,d-1},whered≥2.Showthattheexpectednumberofcharacter-to-charactercomparisonsmadebytheimplici
isiqi·2006-09-05 22:00

算法导论习题[Exercises 9.3-7 ]

Describe an O(n)-time algorithm that, given a set S of n distinct numbers and a positive integer k ≤ n, determines the k numbers in S that are closest to the median of S. solution: 1: procedure k_Cl
isiqi·2006-09-05 22:00
上一页 3 4 5 6 7 8 9 10 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他