編程實(shí)習(xí)報(bào)告09061109-楊宇超-wenkub
2022-08-31 07:35:58 本頁(yè)面
【正文】 h(stdout)。 strcpy(students1[0],name)。 marks1[0][0]=marks1[0][1]=marks1[0][2]=marks1[0][3]=marks1[0][4]=0。 return。 break。if (students1 == NULL) merror(6)。free((void*) name)。marks1[i+1] = NULL。}/* function DeleteStudent *//*This function prompts the user to enter a student nameto be precise form of the prompt is Enter Student Name to be deleted from Class List:Then this function reads the name from standard input.But it must be able to read any name of any size!! Thus you haveto allocate memory (using malloc()) to read the input into, and ifit is not big enough, must use realloc() to extend it. You are notallowed to allocate more than 10 bytes in one allocation or extendyour segment by more than 10 bytes in one call to realloc().Do not forget to deallocate the memory before exiting the function!Note that this part of the code is the same as in InsertStudent(),so you can either copy it or write a function that would do it for both.Once the function has the name to be deleted, it traverses the arraystudent to find out if it is there. If not, a warning message isdisplayed student xxx not in the class list and the function terminates.If it is found (say its is students[d]), a dynamic onedimensional array oneitem shorter than students is created and the strings from the array studentsare unhooked from the arrays students and hooked to the new array with theexception of the string to be deleted (don39。 char** students1。 printf(Enter Student Name to be deleted from Class List:\n)。 studentsx=*students。 i++) { if (strcmp(studentsx[i],name) == 0) { found = 1。 marks1 = (int**) malloc((b+1)*sizeof(int*))。 marks1[i]=marksx[i]。 marks1[i]=marksx[i+1]。 free((void*)marksx[j])。 *marks=marks1。 return。 for(j=0。i++) { if ((strcmp(students[i],students[i+1]))=0) { temp=students[i]。 marks[i]=marks[i+1]。students[i]!=NULL。s reply using gets() into a character arrays of size 80.Then it uses sscanf() on that array to extract the response. Etc.for the third, fourth, and fifth.Note that both students and marks are passed to thisfunction by value,for this function does not need to modify the value stored in the pointer student.The same applies to marks.*/void EditMarks(char** students,int** marks){ int found, i, j。 name = ReadLine()。 j=i。,39。marks[j][1],amp。 return。int i, j, size。while(1) { for(i = 0。\n39。 } }/*endfor*/ if (i == 10 amp。) { size += 10。}/*endwhile*/return buf。2）編程過(guò)程中出現(xiàn)的最多問(wèn)題就是運(yùn)行時(shí)總是跳出警告框提示內(nèi)存什么的，出現(xiàn)這個(gè)問(wèn)題主要是寫代碼時(shí)候不嚴(yán)謹(jǐn)，多處地方不能統(tǒng)一，導(dǎo)致機(jī)器運(yùn)行是容易出錯(cuò)，避免這種問(wèn)題要仔細(xì)查看代碼任何一處地方，所有代碼都要遵守規(guī)則；3）在編寫過(guò)程中出現(xiàn)了很多問(wèn)題，現(xiàn)挑主要問(wèn)題說(shuō)明如下：調(diào)用函數(shù)是，子函數(shù)沒(méi)有形參，調(diào)用時(shí)卻添加了形參；定義變量時(shí)沒(méi)有注意類型，在輸入時(shí)錯(cuò)誤使用了輸入格式；一個(gè)子函數(shù)包含多一些語(yǔ)句時(shí)，容易漏掉大括號(hào)導(dǎo)致程序檢查時(shí)主函數(shù)出現(xiàn)錯(cuò)誤；輸入的方法錯(cuò)誤導(dǎo)致運(yùn)行出錯(cuò)；調(diào)用查找、修改函數(shù)不能進(jìn)入函數(shù)中，鏈表地址指向不對(duì)，語(yǔ)句放置位子不對(duì)；以上問(wèn)題在老師的指導(dǎo)下，一個(gè)一個(gè)解決了，同時(shí)也給自己加深了編寫程序要注意的地方。總結(jié)：本次編程學(xué)習(xí)到了很多知識(shí)，特別感受到了鏈表在C語(yǔ)言中比數(shù)組來(lái)的更加方便，雖然完成了本次實(shí)習(xí)目的，但是設(shè)計(jì)出的軟件還有很大缺陷，不是很完善，在幾個(gè)地方不是很人性化，需要改進(jìn)，比如在保存文件有累贅部分，有待完
環(huán)評(píng)公示相關(guān)推薦
鄂ICP備17016276號(hào)-1