Search - INT 2 - CodeBus

[SCM] Interface PC KEYBOARD using 8051 INT pin

Description: Interface PC KEYBOARD using 8051 INT pin
Platform: | Size: 2048 | Author: 高威 | Hits:

[Crack Hack] 大整数的加法

Description: 多数程序设计语言处理整数的能力是有限的，如C语言中，int类型数据范围是-32767----32767。实际问题的处理过程中往往涉及大整数的运算，如RSA加密算法要求至少64bit的整数，本程序是设计算法实现大整数的加减运算。-majority programming language processing is integral to the limited capacity, such as C language, int data type is the scope-32767---- 32767. Practical problems of the treatment process often involves large integer arithmetic, such as the RSA encryption algorithm requires at least 64-bit integers, the procedure is designed algorithm large integer addition and subtraction operations.
Platform: | Size: 1024 | Author: 王承陶 | Hits:

[Other] lxing

Description: 编译原理小程序有点小问题源程序文件内容如下： main() { int a, b a = 10 b = a + 20 } 要求输出如下： (2，”main”) (5，”（”） (5，”)”) (5，”{“} (1，”int”) (2，”a”) (5，”,”) (2，”b”) (5，” ”) (2，”a”) (4，”=”) (3，10) (5，” ”) (2，”b”) (4，”=”) (2，”a”) (4，”+”) (3，20) (5，” ”) (5，”)”)-Compiler Principle small programs have a small problem source files as follows : main () (int a, b a = b = a 10 20) output requirements are as follows : (2, "main") (5 ,"(") (5, " ) ") (5 ,"{"} (1," int ") (2," a ") (5 ,",") (2," b ") (5," ") (2," a " ) (4 ,"=") (3,10) (5, "") (2, "b") (4 ,"=") (2, "a") (4, "") (3,20 ) (5, "") (5 ,")")
Platform: | Size: 1024 | Author: 刘星 | Hits:

[OS program] BootCmos

Description: 龙已飞去的屠龙刀,系统关键数据/区MBR,DBR,CMOS-RAM 管理工具,适用Win9X/DOS ,开发工具BC3.1(+Turbo Vision),BIOS Int 13h-exiting the holding, the system key data/MBR District, DBR, CMOS-RAM management tools, application Win9X/DOS, development tools BC3.1 (Turbo Vision), the BIOS Int 13h
Platform: | Size: 111616 | Author: szh | Hits:

[DSP program] tms320c54x-example

Description: TMS320C54X DSP 实验指导程序实验一常用指令实验实验二数据存储实验实验三 I/O实验实验四定时器实验实验五 INT2中断实验实验六 A/D转换实验实验七 D/A转换实验实验八 AD/DA综合实验 -TMS320C54X DSP experimental procedures to guide an experimental common directive experimental experimental data storage is 2 three experimental testing of I/O The Experiment The Experiment 4 timer interruption five INT2 The Experiment 6 A/D converter The Experiment 7 D/A conversion The Experiment 8 AD/DA Experiment
Platform: | Size: 246784 | Author: | Hits:

[Other] BCD-int

Description: BCD码和16/32位有符号以及无符号整型数之间的转换-BCD and 16/32 bits signed and unsigned integer conversion between the
Platform: | Size: 1024 | Author: huhc | Hits:

[Embeded Linux] 4.3_int_test

Description: Embest Arm EduKit II Evaluation Board External Interrupt Test Example Please Select the trigger: 1 - Falling trigger 2 - Rising trigger 3 - Both Edge trigger 4 - Low level trigger 5 - High level trigger any key to exit... Press the buttons push buttons may have glitch noise problem EINT6 had been occured... LED1 (D1204) on-Embest Arm EduKit II Evaluation Board Exte rnal Interrupt Test Example Please Select the t rigger : 1-Falling trigger 2-Rising trigger 3-Both Edg e trigger 4-Low level trigger 5-High level trig ger any key to exit Press ... but push the buttons tons may have glitch noise problem EINT6 had bee n occurred ... LED1 (D1204) on
Platform: | Size: 5120 | Author: zhang | Hits:

[ARM-PowerPC-ColdFire-MIPS] ARM9interrupt

Description: arm9 的ADS1.2编译系统的中断源程序，其中含汇编，C程序-arm9 the ADS1.2 compiler system interrupt source files, including a compilation of C Program
Platform: | Size: 35840 | Author: liu | Hits:

[Linux-Unix] INT

Description: 清华大学－电子信息工程系－实验用ARM-linux－源代码－int篇-Tsinghua University- Electronic Information Engineering- experiment with ARM-linux-source code-int article
Platform: | Size: 11264 | Author: 姜勇 | Hits:

[Embeded Linux] led_linux2.4.18

Description: Linux 2.4.18 s3c2440 led driver 使用dev-C++撰寫，需要linux 2.4.18 kernel include，編譯完成後產生led module。 insmod main.o //安裝模組 mknod /dev/leds c 221 0 使用方法： int main(int argc, char *argv[]) { int testdev //led test... testdev = open("/dev/QuickMarkLed",O_RDWR) ioctl(testdev, 2, 1) //ioctl(device, led number, open/close) open=1 ioctl(testdev, argv[1][0]- 0 , argv[2][0]- 0 ) //ioctl(device, led number, open/close) open=1 close(testdev) return 0 } -Linux 2.4.18 s3c2440 led driver to use dev-C++ Writing, the need for linux 2.4.18 kernel include, compiled after the completion of led module. insmod main.o// install the module mknod/dev/leds c 221 0 to use: int main (int argc, char* argv []) (int testdev// led test ... testdev = open (/ dev/QuickMarkLed , O_RDWR) ioctl (testdev, 2, 1)// ioctl (device, led number, open/close) open = 1 ioctl (testdev, argv [1] [0]- 0, argv [2] [0]- 0 )// ioctl (device, led number, open/close) open = 1 close (testdev) return 0)
Platform: | Size: 5120 | Author: Jia-Yang Chen | Hits:

[Other] ch2

Description: #include"c1.h" typedef int ElemType #include"c2-2.h" #include"bo2-4.cpp" void MergeList_CL(LinkList &La,LinkList Lb) { LinkList p=Lb->next Lb->next=La->next La->next=p->next free(p) La=Lb }-# Include c1.h typedef int ElemType# Include c2-2.h# Include bo2-4.cpp void MergeList_CL (LinkList
Platform: | Size: 38912 | Author: 冰河 | Hits:

[SCM] INT

Description: 在主机上编译后，上传INT，重起开发板。在主机上编译后，上传CLOCK，重起开发板。-Compiled in the host, upload INT, re-starting development board. Compiled in the host, upload CLOCK, re-starting development board.
Platform: | Size: 10240 | Author: 哈哈哈 | Hits:

[DSP program] DSP-INT

Description: TI公司生产的C54系列DSP中断实验程序-TI produced C54 series DSP interrupt experimental procedures
Platform: | Size: 45056 | Author: 小王 | Hits:

[Windows Develop] ew

Description: for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- A polynomial of degree n has the common form as. Your task is to write a function to find a root of a given polynomial in a given interval. Format of functiondouble Polynomial_Root (int n, double c [], double a, double b, double EPS) where int n is the degree of the polynomial double c [] is an array of n+ 1 coefficients,, ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root.The function must return the root.Note: It is guaranteed that a unique real number r exists in the given interval such that p (r) = 0.
Platform: | Size: 1024 | Author: Alex Zhang | Hits:

[ARM-PowerPC-ColdFire-MIPS] int

Description: 2440 中断实例按键盘键点亮LED灯，非常好的代码-2440 interrupt
Platform: | Size: 4096 | Author: poiu | Hits:

[Embeded-SCM Develop] Timer_INT..

Description: timer int for pic 16f8-timer int for pic 16f877
Platform: | Size: 1024 | Author: Thang | Hits:

[JSP/Java] GeneratePossionDistribution_codes

Description: 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 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
Platform: | Size: 155648 | Author: 黃文岩 | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list