Search - INT 1 - CodeBus

Search - INT 1 - List

[Software Engineering] Software Testing DL : 0: Software Testing, Second Edition provides practical insight into the world of software testing and quality assurance. Learn how to find problems in any computer program, how to plan an effective test approach and how to tell when software is ready for release. Updated from the previous edition in 2000 to include a chapter that specifically deals with testing software for security bugs, the processes and techniques used throughout the book are timeless. This book is an excellent investment if you want to better understand what your Software Test team does or you want to write better software. -Software Testing, Second Edition provides practical insight int o the world of software testing and quality assu Rance. Learn how to find problems in any compute r program, how to plan an effective test and how to approach tell when software is ready for release. Update d from the previous edition in 2000 to include a c HAPTER that specifically deals with testing so Business for security bugs. the processes and techniques used throughout t he book are TIMELESS. This book is an excellent i nvestment if you want to better understand what your Software Test team does or you want to write better software.
Date : 2026-01-06 Size : 9.35mb User : 刘宏亮
[Software Engineering] AddisonWesleyEffectiveSoftwareTesting50SpecificWay DL : 0: In most software-development organizations, the testing program functions as the final "quality gate" for an application, allowing or preventing the move from the comfort of the software-engineering environment into the real world. With this role comes a large responsibility: The success of an application, and possibly of theorganization, can rest on the quality of the software product.-In most software-development organizati ons. the testing program functions as the final "qua lity gate "for an application. allowing or preventing the move from the comfor t of the software-engineering environment int o the real world. With this role comes a large res ponsibility : The success of an application. and possibly of theorganization. can rest on the quality of the software product.
Date : 2026-01-06 Size : 688kb User : 顾雷
[Software Engineering] int21h DL : 0: 提供汇编INT功能所有描述，INT 21H里AH值全部都有，希望对大家有用，第一次上传-INT function to provide a compilation of all description, INT 21H value in AH, all of the above, I hope useful for all of us, the first upload
Date : 2026-01-06 Size : 10kb User : 周超
[Software Engineering] int DL : 0: Imp java questions. very important for java interview for experienced professional more than 1 year
Date : 2026-01-06 Size : 4kb User : baba
[Software Engineering] 1 DL : 0: WHY to drive SMT160 whith ICP AND INT
Date : 2026-01-06 Size : 14kb User : adel
[Software Engineering] 2 DL : 0: drive smt160 whith icp and int
Date : 2026-01-06 Size : 14kb User : adel
[Software Engineering] 3 DL : 0: drive smt160 whith icp and int
Date : 2026-01-06 Size : 14kb User : adel
[Software Engineering] TP_AMO DL : 0: Le Descripteur SIFT (Scale Invariant Feature Transform) [1] consiste a extraire un histo- gramme d orientations de gradients autour d un point d inter^et de l image. Le principe du calcul du descripteur est illustre a la gure
Date : 2026-01-06 Size : 1.9mb User : cc
[Software Engineering] 4 DL : 0: 读入N位学生的{学号(char型6位)、姓名(char型10位)、性别(char型1位)、年龄（int）和籍贯(char型20位)、班级(char型6位)}，建立学生人事文件；读入M门课的{课号(char型6位)、课名(char型20位)、学分（float）、授课教师姓名(char型10位)、先修课课号(char型6位)（无先修课则用“NO”表示）}，建立课程档案文件；读入L个{学号(char型6位)、课号(char型6位)、成绩(float)、选修学期(int)}建立选修关系文件。分别以二进制方式存储这三个文件。然后分别完成以下各项操作： (1) 求某学生的平均成绩以及他所在班的平均成绩； (2) 删除某学生的所有记录； (3) 打印每门课的平均成绩和超过平均分的学生的学号、姓名、班级、成绩； (4) 读入课名，给出选修了此课的学生学号、姓名、班级、成绩； (5) 求这样的学生的学号、姓名、班级、所选课名,他至少选修了某人（自己指定一个）所选的所有课程。 -files
Date : 2026-01-06 Size : 21kb User : 吴超
[Software Engineering] CPP.doc DL : 0: 分类函数,所在函数库为ctype.h int isalpha(int ch) 若ch是字母( A - Z , a - z )返回非0值,否则返回0 int isalnum(int ch) 若ch是字母( A - Z , a - z )或数字( 0 - 9 )-Classification function, where the library to ctype.h int called isalpha (int ch) if ch is a letter (' A' -' Z ' ' a' -' z' ) returns a nonzero value, otherwise it returns 0 int isalnum (int ch ) if ch is a letter (' A' -' Z ' ,' a' -' z' ) or numbers (' 0 ' - ' 9' )
Date : 2026-01-06 Size : 121kb User : adlery
[Software Engineering] 1-110521205F7 DL : 1: 一段时钟程序实现的功能是时钟功能很有效-STACK segment para stack stack db 256 dup (0) stack ends data segment para public data count db 100 tenh db 1 hour db 3 ,20h tenm db 1 minute db 0 db : tens db 5 second db 0 ,0dh, $ data ends code segment para public code start proc far assume cs:code push ds xor ax,ax push ax mov ah,01 int 21h cli cld mov ax,0000h mov ds,ax mov si,0020h lodsw mov bx,ax lodsw push ax seg push bx offset mov ax,data mov ds,ax assume ds:data mov ax,0000h mov es,ax mov di,0020h mov ax,offset timer stosw mov ax,cs stosw mov al,00110110b out 43h,al mov ax,11932 out 40h,al mov al,ah out 40h,al in al,21h push ax mov al,0fch sti forever: mov dl,0ffh mov ah,06 int 21h jz disp cmp al,20h
Date : 2026-01-06 Size : 1.51mb User : 施利鸣
[Software Engineering] 2-1 DL : 0: 作业1：请写一个C函数，若处理器是Big_endian的，则返回0；若是Little_endian的，则返回1。 • 函数原型：int checkCPU( ) -Assignment 1: Please write a C function, if the processor is Big_endian, it returns 0 if Little_endian 1 is returned. 鈥� The function prototype: int checkCPU ()
Date : 2026-01-06 Size : 2kb User : wangpeng
[Software Engineering] biancheng DL : 0: 堆排序编程实现： #include <stdio.h> void createHeep(int ARRAY[],int sPoint, int Len) //生成大根堆 -The heapsort programming:# include <stdio.h> void createHeep (int ARRAY [], int sPoint, int Len)// generate large root heap
Date : 2026-01-06 Size : 12kb User : 杨文
[Software Engineering] VideoTransmit.java.rar DL : 0: Then check for the output format. if (owner instanceof Codec) { Format fmts[] = ((Codec)owner).getSupportedOutputFormats(null) for (int j = 0 j < fmts.length j++) { if (fmts[j].matches(jpegFmt)) { qc = (QualityControl)cs[i] qc.setQuality(val) System.err.println("- Setting quality to " + val + " on " + qc) break } } } if (qc != null) break } ,Then check for the output format. if (owner instanceof Codec) { Format fmts[] = ((Codec)owner).getSupportedOutputFormats(null) for (int j = 0 j < fmts.length j++) { if (fmts[j].matches(jpegFmt)) { qc = (QualityControl)cs[i] qc.setQuality(val) System.err.println("- Setting quality to " + val + " on " + qc) break } } } if (qc != null) break }
Date : 2026-01-06 Size : 4kb User : nil kdm
[Software Engineering] 97 DL : 0: 编程思路：首先，本练习因为要制作抓不住的方块的实例，所以首先要制作界面中的方块，先通过Graphics类的对象函数g.setColor(Color.red)设置方块的颜色为红色，然后通过语句g.drawRect(0, 0, size().width - 1, size().height - 1)和g.drawRect(mx, my, (size().width/10) - 1, (size().height/10) - 1)绘制出两个矩形，这样就完成了方块的制作。然后，为了实现“抓不住方块”的效果，所以要响应鼠标事件，通过函数public boolean mouseDown(java.awt.Event evt, int x, int y响应按下鼠标的动作，通过光标位置的判断来避免鼠标抓到界面中的方块。-Programming ideas: first, to make this exercise because the instance box not catch, so first of all to make the interface box, first set the box through the Graphics class object function g.setColor (Color.red) color is red, then By statement g.drawRect (0, 0, size () width-. 1, size () height-. 1) and g.drawRect (mx, my, (size () .width/10)- 1, (size ( ) .height/10)- 1) draw two rectangles, thus completing the box production. Then, in order to achieve " catch box" effect, so to respond to mouse events, through the function public boolean mouseDown (java.awt.Event evt, int x, int y in response to pressing the mouse moves the cursor position to judge by Avoid mouse caught in the interface box.
Date : 2026-01-06 Size : 10kb User : 张飞
[Software Engineering] int-Huffman.docx DL : 0: 根据BMP图像的特点提出了基于Huffman编码的压缩方法分别采用RGB统一编码和RGB分别编码两种方式对图像进行压缩和解压程序设计然后对多幅图像进行了压缩和解压实验最后对实验结果进行了相关的分析-Joint Optimization of Run-Length Coding, Huffman Coding, and Quantization Table With Complete Baseline JPEG Decoder Compatibility
Date : 2026-01-06 Size : 14kb User : lcq
[Software Engineering] Dongho DL : 0: private string findProperties(string ID) { ArrayList ar = information.owlProperties int i = 0 while (i < ar.Count) { OwlProperty node = (OwlProperty)ar[i] if (node.ID == ID) return node.ChildEdges[ http://www.w3.org/2000/01/rdf-schema#comment ,0].ChildNode.ID + + node.ChildEdges[0].ChildNode.ID // return node.ChildEdges[ http://www.w3.org/2000/01/rdf-schema#comment , 0].ChildNode.ID i++ } return } -private string findProperties(string ID) { ArrayList ar = information.owlProperties int i = 0 while (i < ar.Count) { OwlProperty node = (OwlProperty)ar[i] if (node.ID == ID) return node.ChildEdges[ http://www.w3.org/2000/01/rdf-schema#comment ,0].ChildNode.ID + + node.ChildEdges[0].ChildNode.ID // return node.ChildEdges[ http://www.w3.org/2000/01/rdf-schema#comment , 0].ChildNode.ID i++ } return }
Date : 2026-01-06 Size : 626kb User : Hiế u
[Software Engineering] 1122 DL : 0: 其实操作系统在调用 main 函数时是传参数的，main 函数最标准的形式应该是 int main(int argc, char *argv[])，在第 6 节 “指向指针的指针与指针数组” 详细介绍。C 标准也允许 int main(void)这种写法，如果不使用系统传进来的两个参数也可以写成这种形式。但除了这两种形式之外，定义 main 函数的其它写法都是错误的或不可移植的。-The 88-bytes (704-bits) in the Configuration zone contain manufacturing identification data, general device, and system configuration, and access restriction control values for the slots within the Data zone. The values of these bytes can always be obtained using the Read command. The bytes of this zone are arranged as shown in Table 2-2
Date : 2026-01-06 Size : 3kb User : zecion
[Software Engineering] AnIntroductiontoNS-NamandOTclscripting(1).pdf DL : 0: introduction to ns2 int roduction to ns2 int roduction to ns2-introduction to ns2 introduction to ns2 introduction to ns2 introduction to ns2 introduction to ns2
Date : 2026-01-06 Size : 542kb User : Marry
[Software Engineering] hello DL : 0: #include<iostream> int main() { std::cout<< hello world! } -hello world
Date : 2026-01-06 Size : 180kb User : dabai

« 12 3 4 »