初級(jí)程序員問(wèn)答考試卷模擬考試.題_2

1、姓名：_ 班級(jí)：_ 學(xué)號(hào)：_-密-封 -線- 初級(jí)程序員問(wèn)答考試卷模擬考試.題考試時(shí)間：120分鐘 考試總分：100分題號(hào)一二三四五總分分?jǐn)?shù)遵守考場(chǎng)紀(jì)律，維護(hù)知識(shí)尊嚴(yán)，杜絕違紀(jì)行為，確?？荚嚱Y(jié)果公正。1、【說(shuō)明】本程序從正文文件text.in中讀入一篇英文短文，統(tǒng)計(jì)該短文中不同單詞及出現(xiàn)次數(shù)，并按詞典編輯順序?qū)卧~及出現(xiàn)次數(shù)輸出到正文文件word.out中。程序用一棵有序二叉樹(shù)存儲(chǔ)這些單詞及其出現(xiàn)的次數(shù)，邊讀入邊建立，然后中序遍歷該二叉樹(shù)，將遍歷經(jīng)過(guò)的二叉樹(shù)上的結(jié)點(diǎn)內(nèi)容輸出。【函數(shù)】# include stdio.h# include malloc.h# include ctype.h# in

2、clude string.h# define inf “text.in”# define outf “word.ourtypedef struct treenodechar *word;int count;struct treenode *left, *right;bnode;int getword(file *fpt, char *word)char c;c=fgetc(tpt);if (c=eof)return 0;while(!(tolower(c)= a & tolower(c)= z)c=fgetc(fpt);if (c=eof)return 0;/* 跳過(guò)單詞間的所有非字母字符 *

3、/while(tolower(c)= a & tolower(c)= z)*word+=c;c=fgetc(fpt);*word=/0;return 1;void binary_tree(bnode *t, char *word)bnode *ptr, *p; int compres;p=null;(1);while (ptr) /* 尋找插入位置 */compres=strcmp(word, ptr-word);/* 保存當(dāng)前比較結(jié)果 */if (!compres)(2); return;elsep=ptr;ptr=compres0 ptr-right: ptr-left;ptr=(bnod

4、e *)malloc(sizeof(bnode);ptr-left=ptr-right=null;ptr-word=(char *)malloc(strlen(word)+1);strcpy(ptr-word, word);(3);if (p=null)*t=ptr;else if (compres0)p-right=ptr;elsep-left=ptr;void midorder(file *fpt, bnode *t)if (t=null)return;midorder(fpt,(4);fprintf(fpt, “%s %d/n”, t-word, t-count);midorder(fpt, t-right);void main（ ）file *fpt; char word40;bnode *root=null;if (fpt=fopen(inf, “r”)=null)printf(“cant open file %s/n”, inf);return;while(getword(fpt, word)=1)binary_tree(5);fclose(fpt);fpt=fopen(outf, “w”);if (fpt=null)printf(“cant open