最近在学习Oracle，对测试人员而言必须掌握两种语言：第一种是DML，数据操纵语言 (Data Manipulation Language) 是SQL语言中，负责对数据库对象运行数据访问工作的指令集，以INSERT、UPDATE、DELETE三种指令为核心，分别代表插入、更新与删除。第二种是：DQL，数据查询语言 (Data Query Language) 是SQL语言中，负责进行数据查询而不会对数据本身进行修改的语句，这是最基本的SQL语句。核心指令为SELECT，以及一些辅助指令，如FROM、WHERE等，FROM：表示来源，可以搭配JOIN做链接查询； WHERE：过滤条件；GROUP BY：在使用聚合函数时用到，如SUM,COUNT,MAX,AVG；HAVING：对聚合结果进行筛选，这是和WHERE的不同点；ORDER BY：排序。
标签： oracle 基础 资料
上传时间： 2016-09-15
上传用户：天涯云海
This example shows how to detect and COUNT cars in a video sequence using foreground detector based on Gaussian mixture models (GMMs)
标签： Detecting Gaussian Mixture Models Using Cars
上传时间： 2016-12-10
上传用户：Fgufsett
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*运动员*/ { char name[20]; int score; /*分数*/ int range; /**/ int item; /*项目*/ }ATH; typedef struct schoolstruct /*学校*/ { int COUNT; /*编号*/ int serial; /**/ int menscore; /*男选手分数*/ int womenscore; /*女选手分数*/ int totalscore; /*总分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n输入运动项目序号 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n这个项目已经存在请选择其他的数字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n项目不存在"); printf("\n请重新输入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n输入序号 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超过学校数目,请重新输入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->COUNT = pfirst->COUNT + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->COUNT].item = overgame; pfirst->athlete[pfirst->COUNT].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->COUNT].name); } printf("\n继续输入运动项目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->COUNT;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d号学校的结果成绩:",pfirst->serial); printf("\n\n项目的数目\t学校的名字\t分数"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->COUNT;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 进入下一页"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n运动会结果:\n\n学校编号\t男运动员成绩\t女运动员成绩\t总分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建结束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->COUNT = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已经成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 运动会分数统计\n"); printf("输入学校数目 (x>= 5):"); scanf("%d",&nsc); printf("输入男选手的项目(x<=20):"); scanf("%d",&msp); printf("输入女选手项目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
标签： 源代码
上传时间： 2016-12-28
上传用户：150501
题目：古典问题：有一对兔子，从出生后第3个月起每个月都生一对兔子，小兔子长到第三个月后每个月又生一对兔子，假如兔子都不死，问每个月的兔子总数为多少？ //这是一个菲波拉契数列问题 public class lianxi01 { public static void main(String[] args) { System.out.println("第1个月的兔子对数: 1"); System.out.println("第2个月的兔子对数: 1"); int f1 = 1, f2 = 1, f, M=24; for(int i=3; i<=M; i++) { f = f2; f2 = f1 + f2; f1 = f; System.out.println("第" + i +"个月的兔子对数: "+f2); } } } 【程序2】 题目：判断101-200之间有多少个素数，并输出所有素数。 程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 public class lianxi02 { public static void main(String[] args) { int COUNT = 0; for(int i=101; i<200; i+=2) { boolean b = false; for(int j=2; j<=Math.sqrt(i); j++) { if(i % j == 0) { b = false; break; } else { b = true; } } if(b == true) {COUNT ++;System.out.println(i );} } System.out.println( "素数个数是: " + COUNT); } } 【程序3】 题目：打印出所有的 "水仙花数 "，所谓 "水仙花数 "是指一个三位数，其各位数字立方和等于该数本身。例如：153是一个 "水仙花数 "，因为153=1的三次方＋5的三次方＋3的三次方。 public class lianxi03 { public static void main(String[] args) { int b1, b2, b3;
上传时间： 2017-12-24
上传用户：Ariza
可用作字频统计，词频分析，论文查重，支持中文分析
标签： 词频统计
上传时间： 2018-04-30
上传用户：Dear
#include<stdio.h> #define TREEMAX 100 typedef struct BT { char data; BT *lchild; BT *rchild; }BT; BT *CreateTree(); void Preorder(BT *T); void Postorder(BT *T); void Inorder(BT *T); void Leafnum(BT *T); void Nodenum(BT *T); int TreeDepth(BT *T); int COUNT=0; void main() { BT *T=NULL; char ch1,ch2,a; ch1='y'; while(ch1=='y'||ch1=='y') { printf("\n"); printf("\n\t\t 二叉树子系统"); printf("\n\t\t*****************************************"); printf("\n\t\t 1---------建二叉树 "); printf("\n\t\t 2---------先序遍历 "); printf("\n\t\t 3---------中序遍历 "); printf("\n\t\t 4---------后序遍历 "); printf("\n\t\t 5---------求叶子数 "); printf("\n\t\t 6---------求结点数 "); printf("\n\t\t 7---------求树深度 "); printf("\n\t\t 0---------返 回 "); printf("\n\t\t*****************************************"); printf("\n\t\t 请选择菜单号 （0--7）"); scanf("%c",&ch2); getchar(); printf("\n"); switch(ch2) { case'1': printf("\n\t\t请按先序序列输入二叉树的结点:\n"); printf("\n\t\t说明：输入结点（‘0’代表后继结点为空）后按回车。\n"); printf("\n\t\t请输入根结点:"); T=CreateTree(); printf("\n\t\t二叉树成功建立！\n");break; case'2': printf("\n\t\t该二叉树的先序遍历序列为:"); Preorder(T);break; case'3': printf("\n\t\t该二叉树的中序遍历序列为:"); Inorder(T);break; case'4': printf("\n\t\t该二叉树的后序遍历序列为:"); Postorder(T);break; case'5': COUNT=0;Leafnum(T); printf("\n\t\t该二叉树有%d个叶子。\n",COUNT);break; case'6': COUNT=0;Nodenum(T); printf("\n\t\t该二叉树总共有%d个结点。\n",COUNT);break; case'7': printf("\n\t\t该树的深度为:%d",TreeDepth(T)); break; case'0': ch1='n';break; default: printf("\n\t\t***请注意：输入有误！***"); } if(ch2!='0') { printf("\n\n\t\t按【Enter】键继续，按任意键返回主菜单！\n"); a=getchar(); if(a!='\xA') { getchar(); ch1='n'; } } } } BT *CreateTree() { BT *t; char x; scanf("%c",&x); getchar(); if(x=='0') t=NULL; else { t=new BT; t->data=x; printf("\n\t\t请输入%c结点的左子结点:",t->data); t->lchild=CreateTree(); printf("\n\t\t请输入%c结点的右子结点:",t->data); t->rchild=CreateTree(); } return t; } void Preorder(BT *T) { if(T) { printf("%3c",T->data); Preorder(T->lchild); Preorder(T->rchild); } } void Inorder(BT *T) { if(T) { Inorder(T->lchild); printf("%3c",T->data); Inorder(T->rchild); } } void Postorder(BT *T) { if(T) { Postorder(T->lchild); Postorder(T->rchild); printf("%3c",T->data); } } void Leafnum(BT *T) { if(T) { if(T->lchild==NULL&&T->rchild==NULL) COUNT++; Leafnum(T->lchild); Leafnum(T->rchild); } } void Nodenum(BT *T) { if(T) { COUNT++; Nodenum(T->lchild); Nodenum(T->rchild); } } int TreeDepth(BT *T) { int ldep,rdep; if(T==NULL) return 0; else { ldep=TreeDepth(T->lchild); rdep=TreeDepth(T->rchild); if(ldep>rdep) return ldep+1; else return rdep+1; } }
上传时间： 2020-06-11
上传用户：ccccy
全志A20核心板配套开发底板Cadence原理图+ Pads2005格式PCB文件+转换后的AD格式原理图PCB文件：A20_DVK1_BASE_V16_Altium_Designer15.PcbDocA20_DVK1_BASE_V16_BOM_20151015.xlsxA20_DVK1_BASE_V16_Gerber制板文件.rarA20_DVK1_BASE_V16_PADS2005_PCB30.pcbA20_DVK1_BASE_V16_PADS2005_PCB_ASCII.PcbDocA20_DVK1_BASE_V16_PADS9.5.pcba20_dvk1_base_v16_SCH_20151015.pdfA20_DVK1_BASE_V16_元件位置查找图_20151102.pdfA20_DVK1_BASE_V16_原理图_OrCAD16.5.DSNA20_DVK1_BASE_V16_导出到AD格式的原理图和PCBA20_DVK1_BASE_V16_导出到AD格式的原理图和PCB.rarA20_DVK1_BASE_V16_顶层元件编号丝印图_20151102.pdfA20_DVK1_BASE_V16_顶层元件规格丝印图_20151102.pdf主要器件如下：Library Component COUNT : 58Name Description----------------------------------------------------------------------------------------------------ANTBATTERY_1BEAD CAPCAP NP 贴片电容,Y5V,6.3V,2.2uF,+80%-20%,0603CAP NP_2_Dup1 X5RCAP NP_Dup2 0402 1uF X5R 6.3V +/-10%CAP NP_Dup3 0402 1uF X5R 6.3V +/-10%CAPACITOR CAPACITOR POLCON1 CON12 CON3 CON4 CON50 CON6CON6A CONNECTOR45X4 C_Generic DB15-VGA_0 DIODE DIODE DUAL SERIESFM25CL64 FR9886SPGTR FUSEHOLDER_0 HDMI19_PLUG HEADER 2 INDUCTOR/SMINDUCTOR_4 C4K-2.5HINDUCTOR_Dup2 INDUCTOR_Dup3 IRM-2638LED_0M93C46_0 MINI USB-B_6 MODULE_CAM_PA0505 PH163539 PLAUSB-AF5P-WSMT_0 PUSHBUTTON_TSKB-2L_0PowerJACK R1 0805 R1_0805 RES2X4RESISTOR RESISTOR_Dup1 RESISTOR_Dup2 RESISTOR_V RJ45_8PGR_Generic S9013SMD_Dup2 SD_MMC_CARD2_0 TP_5 TestPoint_3TitleBlock_Gongjun USBPORT2 USB_WIFI_0 XC6204VZ_3 LDO 3.3V 300mA( SOT-25 )rRClamp0524P
上传时间： 2021-11-08
上传用户：
全志A33核心板应用开发底板OrCAD16.5格式原理图+PADS9.5格式PCB图+转AD格式的原理图PCB文件,可以做你的学习设计参考，应用开发底板主要器件如下：Library Component COUNT : 180Name Description----------------------------------------------------------------------------------------------------1_0.5KE100A1_1.5KE100A1_2.5KE100A1_3.5KE100A1_4.5KE100A2N6770_0?_0 ACA-5036 ADV7123_0 ANTANT_0 ANT_1 ANT_2AP6493_0AP6493_1AP6493_2AT24C16 AT88SC0104CAW1625_CSI_eLQFP176_0R0603R1 0805R1 0805_Dup1R1_0805RESISTOR RESISTOR_0RESISTOR_V RT9266PE_0RT9266PE_1 RTL8152B_0 R_0 R_Dup1R_Dup2R_Dup3 R_GenericS9013SMDSD_MMC_CARD2_0 SEW290_0 SEW290_1 SIM_SOCKET_0 SWL-N10S_0SWL-N10S_1 SWPB2X1BSchottkyTC_SMD TP_5TestPoint_3TitleBlock0-AW TitleBlock_Gongjun U-CONN_0USBHOST_X2 USB_WIFI_0WPM4005_11bga280_3 capnp cappoleLQFP176_0 eLQFP176_6 eMMC-BGA169
上传时间： 2021-11-13
上传用户：
74HC595 A4950 MAX3232 ULN2003AD STM32F207VCT6 AD集成封装库，原理图库器件型号列表：Library Component COUNT : 53Name Description----------------------------------------------------------------------------------------------------1N4148 High Conductance Fast Diode1N4448 High Conductance Fast Diode1N914 High Conductance Fast Diode1N914A High Conductance Fast Diode1N914B High Conductance Fast Diode1N916 High Conductance Fast Diode1N916A High Conductance Fast Diode1N916B High Conductance Fast Diode2N3904 NPN General Purpose Amplifier74ALS86 74HC595 8M贴片晶振 A4950 直流电机驱动AO4805CAP CapacitorCAP SMD CapacitorCON2 ConnectorCON2*10 ConnectorCON2*12P ConnectorCON2*7 ConnectorCON2*9 ConnectorCON3 ConnectorCON4 ConnectorCON5 ConnectorCON7 ConnectorCap Pol 极性电解电容DIODE DiodeFUSE1 FuseFUSE2 FuseINDUCTOR2 IRF7351PbF N-MOSJS1-12V-FLED MAX487 MAX809RD R0.125 Less than 1/4 Watt Power Resistor.RES2 RGRPI*4 Res1 ResistorSGM8955XN5G/TR 测量放大器SM712 SN74LV4052AD SP3232ESST25VF016B-50-4I-S2AFI2C Real-Time Clock.STM32F107VTC6 STM32F107VTC6SW DIP-4 编码开关SW-PB SwitchTPS54302 45UA静态电流 3ATVS SMBJ30CAULN2003 XC6214XTAL Crystal OscillatorPCB封装库列表：Component COUNT : 40Component Name-----------------------------------------------4G模块-外置7D181K0603-LED0603C0603R0805C12061210181232255569-2*1P直针5569-2*2P直针AT-26CAP-D8DO-214AANHSOP-8J-SPDT-5JTAGL
上传时间： 2021-11-15
上传用户：ttalli
基于NE555设计的声音传感器模块ALTIUM硬件原理图+PCB文件，2层板设计，大小为29x30mm，Altium Designer 设计的工程文件，包括原理图及PCB文件，可以用Altium(AD)软件打开或修改，可作为你的产品设计的参考。主要器件型号列表如下：Library Component COUNT : 8Name Description----------------------------------------------------------------------------------------------------2N3904 NPN General Purpose AmplifierCap CapacitorComponent_1_1 Header 3H Header, 3-Pin, Right AngleLED3 Typical BLUE SiC LEDMKF 麦克风Res 电阻Res2 Resistor
上传时间： 2021-11-17
上传用户：
