This document describes the features of MMBT4401 silicon. You can check or search the characteristics of this transistor by this document and decide whether the transistor you need.
上传时间： 2016-07-19
上传用户：hsuhueisan
#include "string.h" #include "ctype.h" #include "stdio.h" search(char pd[]) {FILE *fp; int time=0,i=0,j=0,add[80],k=0,m; char *ch, str[900]; m=strlen(pd); if((fp=fopen("haha.txt","r"))==NULL) { printf("Cannot open this file\n"); exit(0); } for(;!feof(fp);i++) { str[i]=fgetc(fp); if(tolower(str[i])==tolower(pd[k])) {k++; if(k==m) if(!isalpha(i-m)&&!isalpha((str[i++]=fgetc(fp)))) { time++; add[j]=i-m+1; j++; k=0; } else k=0; } } if(time) { printf("The time is:%d\n",time); printf("The adders is:\n"); for(i=0;i
标签： 查询学会少年宫
上传时间： 2016-12-29
上传用户：767483511
#include "string.h" #include "ctype.h" #include "stdio.h" search(char pd[]) {FILE *fp; int time=0,i=0,j=0,add[80],k=0,m; char *ch, str[900]; m=strlen(pd); if((fp=fopen("haha.txt","r"))==NULL) { printf("Cannot open this file\n"); exit(0); } for(;!feof(fp);i++) { str[i]=fgetc(fp); if(tolower(str[i])==tolower(pd[k])) {k++; if(k==m) if(!isalpha(i-m)&&!isalpha((str[i++]=fgetc(fp)))) { time++; add[j]=i-m+1; j++; k=0; } else k=0; } } if(time) { printf("The time is:%d\n",time); printf("The adders is:\n"); for(i=0;i<j;i++) printf("%5d",add[i]); if(i%5==0) printf("\n"); getch(); fclose(fp); } else printf("Sorry!Cannot find the word(^_^)"); } main() { char pd[10],choose='y'; int flag=1; while(flag) {printf("In put the word you want to seqarch:"); scanf("%s",pd); search(strlwr(pd)); printf("\nWould you want to continue?(Y/N):"); getchar(); scanf("%c",&choose); if((tolower(choose))=='n') flag=0; else flag=1; } printf("Thanks for your using!Bye-bye!\n"); getch(); }
标签： 学生专用
上传时间： 2016-12-29
上传用户：767483511
（荷）弗兰克（Frenkel & Smit） 等著，中文译版。 主要讲分子模拟的一些方法，MC、MD等，有讲解和算法。
上传时间： 2017-03-15
上传用户：jieliang
链表习题 1. 编程实现链表的基本操作函数。 (1). void CreatList(LinkList &La,int m) //依次输入m个数据，并依次建立各个元素结点，逐个插入到链表尾；建立带表头结点的单链表La； (2). void ListPrint(LinkList La) //将单链表La的数据元素从表头到表尾依次显示。 (3).void ListInsert (LinkList &L,int i,ElemType e){ //在带头结点的单链表L中第i个数据元素之前插入数据元素e (4). void ListDelete(LinkList &La, int n, ElemType &e) //删除链表的第n个元素，并用e返回其值。 (5). int search(LinkList L, ElemType x) //在表中查找是否存在某个元素x，如存在则返回x在表中的位置，否则返回0。 (6). int ListLength(LinkList L) //求链表L的表长 (7). void GetElem(LinkList L, int i, ElemType &e) //用e返回L中第i个元素的值 链表的结点类型定义及指向结点的指针类型定义可以参照下列代码: typedef struct Node{ ElemType data; // 数据域 struct Node *next; // 指针域 }LNode, *LinkList;
标签： 单链表
上传时间： 2017-11-15
上传用户：BIANJIAXIN
1. 编程实现链表的基本操作函数。 (1). void CreatList(LinkList &La,int m) //依次输入m个数据，并依次建立各个元素结点，逐个插入到链表尾；建立带表头结点的单链表La； (2). void ListPrint(LinkList La) //将单链表La的数据元素从表头到表尾依次显示。 (3).void ListInsert (LinkList &L,int i,ElemType e){ //在带头结点的单链表L中第i个数据元素之前插入数据元素e (4). void ListDelete(LinkList &La, int n, ElemType &e) //删除链表的第n个元素，并用e返回其值。 (5). int search(LinkList L, ElemType x) //在表中查找是否存在某个元素x，如存在则返回x在表中的位置，否则返回0。 (6). int ListLength(LinkList L) //求链表L的表长 (7). void GetElem(LinkList L, int i, ElemType &e) //用e返回L中第i个元素的值 链表的结点类型定义及指向结点的指针类型定义可以参照下列代码: typedef struct Node{ ElemType data; // 数据域 struct Node *next; // 指针域 }LNode, *LinkList;
标签： 单链表
上传时间： 2017-11-15
上传用户：BIANJIAXIN
Regardless of the branch of science or engineering, theoreticians have always been enamored with the notion of expressing their results in the form of closed-form expressions. Quite often, the elegance of the closed-form solution is overshadowed by the complexity of its form and the difficulty in evaluating it numerically. In such instances, one becomes motivated to search instead for a solution that is simple in form and simple to evaluate.
标签： Communication Channels Digital Fading over 1st
上传时间： 2020-05-27
上传用户：shancjb
Regardless of the branch of science or engineering, theoreticians have always been enamored with the notion of expressing their results in the form of closed-form expressions. Quite often the elegance of the closed-form solution is overshadowed by the complexity of its form and the difficulty in evaluating it numerically. In such instances, one becomes motivated to search instead for a solution that is simple in form and likewise simple to evaluate.
标签： Communication Channels Digital Fading over 2nd
上传时间： 2020-05-27
上传用户：shancjb
Do you have a mobile phone? We think you probably do, one way or another. We would also guess that you might use it for many diff erent things in the course of your everyday life—as a telephone certainly, but also as an address book, as a clock or watch, as a camera, or now as a connection to your computer, email and the internet. Th ere will be a range of people you use it to contact (or not), and various strategies you use to take calls—or send texts, or take photos, or receive emails, or search online (or not, in diff erent situations). Th ere are also likely to be a range of social relation- ships in your life that your mobile phone helps to maintain—or disrupts, or inter- venes in, or makes possible, or complicates, or just plain helps to handle.
标签： Communications Introduction Mobile Media New An to
上传时间： 2020-05-30
上传用户：shancjb
December 2007, San Jose, California: It seems a long time ago. I walked into a big networking company to head their small Power over Ethernet (PoE) applications team. Surprisingly, I hardly knew anything about PoE prior to that day, having been a switching-power conversion engineer almost all my life. But it seemed a great opportunity to widen my horizons. As you can see, one notable outcome of that seemingly illogical career choice five years ago is the book you hold in your hands today. I hope this small body of work goes on to prove worthy of your expectations and also of all the effort that went into it. Because, behind the scenes, there is a rather interesting story to relate—about its backdrop, intertwined with a small slice of modern PoE history, punctuated by a rather res- tive search for our roots and our true heroes, one that takes us back almost two centuries
上传时间： 2020-06-07
上传用户：shancjb
