登录
首页 » DOS » port_scanner

port_scanner

于 2001-07-08 发布 文件大小:7KB
0 219
下载积分: 1 下载次数: 761

代码说明:

  字符界面下的端口扫描程序( Under character contact surface port scanning procedure )

文件列表:

DPPS.C
dpps.exe
read.txt

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

发表评论

0 个回复

  • bp
    说明:  back poropagation algorithm
    2010-04-04 13:14:15下载
    积分:1
  • Scan
    简单的网络端口扫描器,包括ICMP扫描和connect扫描(Simple network port scanner, including ICMP scan and connect scan)
    2020-11-01 20:59:55下载
    积分:1
  • PortScan_sjtu
    大学时用visual c++写的端口扫描程序,使用tcp/fin/syn进行端口扫描。(University with visual c write port scanning procedures, use tcp/fin/syn port scan conducted.)
    2020-11-01 21:29:55下载
    积分:1
  • port_scanner
    字符界面下的端口扫描程序( Under character contact surface port scanning procedure )
    2001-07-08 09:58:50下载
    积分:1
  • sanner
    说明:  扫描器C源码,大家可以研究一下再说吧,扫描漏洞的(Scanner C source code, we can look at to say it, scanning loopholes)
    2010-05-03 14:06:10下载
    积分:1
  • GrblController361_chs
    激光雕刻机历程,用于易语言激光雕刻机的制作(LED isshow)
    2016-08-27 13:02:04下载
    积分:1
  • SearchSql
    SQL Server命名管道扫描器,扫描一段网络内的Microsoft SQL Server数据库。(SQL Server named pipe scanner Scans a network within the Microsoft SQL Server database.)
    2013-04-25 09:09:25下载
    积分:1
  • svb020404
    说明:  扫描Internet上一个IP地址的端口(Scan the ports of a IP address on Internet.)
    2005-10-19 21:44:05下载
    积分:1
  • SDRSharp1637v2a
    说明:  multi-band recever hf, uhf, vhf with am, fm, lsb, usb, cw etc...
    2020-07-05 05:20:57下载
    积分:1
  • lab
    对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。(For the initial given array, usually present multiple sub-array section has a length greater than a natural sorted. For example, if the array of elements for a {4,8,3,7,1,5,6,2} then naturally sorted subarray segment has {4,8}, {3,7}, {1,5,6}, {2}. used once on a linear array scanning is sufficient to identify all these rows subarray segments good sequence is then sub-arrays adjacent segments sorted pairwise merge to form larger sub-segments sorted array ({3,4,7,8}, {1, 2, 5,6}). Continue merge adjacent sorted subarray section until the entire array is sorted.)
    2014-12-21 20:08:05下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载