program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques. Once your program reads the complete input,it waits for the user input (prompt to the user). User now enters some number.program displays IF this number exists in the list or not. it also display the time taken in the search operation.
标签： program techniques retrieving the
上传时间： 2017-04-27
上传用户：shus521
MAX7044是基于晶振PLL 的VHF/UHF发射器芯片，在300 MHz～450 MHz频率范围内发射OOK/ASK数据，数据速率达到100 kbps，输出功率+13 dBm(50Ω负载)，电源电压+2.1～+3.6 V，电流消耗在2.7 V时仅7.7 mA。工作温度范围一40℃～＋125℃，采用3 mm×3 mm SOT23 - 8封装。 MAX7033是一个完全集成的低功耗CMOS超外差接收器芯片，接收频率范围在300 MHz～450 MHz的ASK信号。接收器射频输入信号范围从一114 dBm-0dBm。MAX7033芯片内部包含有LNA、差分镜像抑制混频器、PLL、VCO、10.7 MHz IF限幅放大器、AGC、RSSI、模拟基带数据信号恢复等电路。工作电压+3.3 V或+5.0V，250μs启动时间，低功耗模式电流消耗<3.5μA，工作温度-40℃～＋105℃，采用TSSOP-28和薄形QFN-EP* *-32封装。 MAXT044发射器芯片与接收器芯片MAX7033配套，适合汽车遥控、无键进入系统、安防系统、车库门控制、家庭自动化、无线传感器等应用。
上传时间： 2017-05-06
上传用户：cuiyashuo
As a programming language, C is rather like Pascal or Fortran.. Values are stored in variables. Programs are structured by defining and calling functions. Program flow is controlled using loops, IF statements and function calls. Input and output can be directed to the terminal or to files. Related data can be stored together in arrays or structures.
标签： programming variables language Fortran
上传时间： 2017-05-18
上传用户：hongmo
This is a desktop application written in java which sends email using gmail smtp. You do not need to go to the browser to send email. IF you do not have a gmail account that is ok too because you can send email by a default account and of course by your own account. You need jdk 1.6 or higher to run it.
标签： application desktop written email
上传时间： 2014-01-14
上传用户：kernaling
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.IF a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
标签： branch-and-strategy Salesperson Traveling solution
上传时间： 2013-12-29
上传用户：璇珠官人
实现火星车,全部由java写成，没有一个IF-else,加上测试文件
上传时间： 2014-01-06
上传用户：xiaoxiang
Playfair Cipher 1.not even the large number of keys in a monoalphabetic cipher provides security 2.one approach to improving security was to encrypt multiple letters 3.the Playfair Cipher is an example 4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair Playfair Key Matrix 1.a 5X5 matrix of letters based on a keyword 2.fill in letters of keyword (sans duplicates) 3.fill rest of matrix with other letters Encrypting and Decrypting -plaintext is encrypted two letters at a time 1. IF a pair is a repeated letter, insert filler like X’ 2. IF both letters fall in the same row, replace each with letter to right (wrapping back to start from end) 3. IF both letters fall in the same column, replace each with the letter below it (again wrapping to top from bottom) 4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
标签： monoalphabetic Playfair provides security
上传时间： 2017-05-25
上传用户：变形金刚
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -IF the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-25
上传用户：2467478207
Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using dIFferent u,you can get x1,x2,x3,...,xn step5:IF the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate dIFferent sequences of numbers each time the program executes
标签： Generate Possion between random
上传时间： 2017-05-25
上传用户：bibirnovis
哲学家吃饭问题 当五个人都拿到左手边筷子，都等待拿右手边筷子，则因为谁都不能放下手中的筷子，这样就进入无止境的等待，构成死锁 * 解决方法1：奇数号先拿左边的筷子，偶数号先拿右边的筷子,即相邻两个人先拿其中间夹的筷子，使这个筷子成为临界资源； * 解决方法2：两边的筷子都空闲时，再拿筷子，IF(chopstick.flag(n)==false&&chopstick.flag(n 5)==false)； * 解决方法3：只允许(n-1)个人同时进餐； * 本程序采用方法1 解决
标签： 家
上传时间： 2017-05-27
上传用户：zsjzc
