Scribd Logo
Upload

Welcome to Scribd!

  • Nhap Mon Lap Trinh de Thi 2019 (Cuuduongthancong - Com)

    Uploaded by

    hnahkyud2911
    0 views3 pages

    Original Title

    Nhap Mon Lap Trinh de Thi 2019 [Cuuduongthancong.com]

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    0 views3 pages

    Nhap Mon Lap Trinh de Thi 2019 (Cuuduongthancong - Com)

    Uploaded by

    hnahkyud2911

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    of 3
    Triimg Dai Hoc Bach Khoa DE THI HOC KY M1 /2018 -2019 Khoa Khoa Hoc & KY Thuit May Tinh Man thi: NHAP MON LAP TRINH ~ CO1003 Neaiy thi: 29/05/2019 This lugng: 90 phist DAP AN DE THI 1821 I. Cite ciiu hai trite nghiém (4d) 1 B 3 c 9 B 1B c 2 B 6 c 10 e 14 B 3 D 7 B a BR 15 A 4 A 8 B 12 e 16 c IL, Cac cau hoi dién két qua (2d) Cau 17. Hay doc va giai thich him sau day Lim gi ? void kiemtra2(int a[],int n) { int max,i,j,temp; zi 2°39) x += Bt i Dip am: 9 2... iu 20, Cho bidt him sau ay tinh gid ti gi int kien 2{int n) { 4£ (n==0) return if ) || (n86!=0)) return n + kiemtra(n-1 return k a(n=1)7 1 Bip dn: Tang eae sb nguyen tir | dn a (Dé nay tdi copy tit dB cae thiy god v8 mi quén kidm tra lai tén hui kiemua, hung ki true d& thi SV c6 hoi va ti da digu chinks tai lp. Tuy nbign, néu cb SV wa liv 1b khdng c6 him kiemtra thicdc thay can nhic eiam) Cau 21, Hay dién vio chd tréng dé hoan chink him getMax nhiim ly ma gif tj lén obit trong mang. ‘Dip dn tham kchio- int getMax(int array[], int n){ int imax for (int ff (imax < return iMax; 1, -Phan tw luan (4a) doe code cita sinh vie dé chitrn) Cau 22. (1.254) Viét chuong trinh luu wio 1 day ede sé nguyén tir | dén N eé dae tinh chin hét cho 7 hung chia 6 dur 3, tinh vain ra ting cua cling. N duoc nhap tir bin phim. Chu 23. (1.28d) Cho chit ky ca ham changeMax va him main nlur sau: int changeMax(int array[], int n, int newMax); int main () t (oie tt int a[10] = (3,-2,5,0/1,8,0,9,4, 9); printf ("the number of changeMax = $d\n", changeMax(a,10,10))3 return 0; ! Hay viét thin him changeMax va cic kim phy tro (néu cia thidi) 48 thay di gid ti Lom nat cin mang array[] c6 kich thudc n bang gia tri mai li newMax. Him changeMax s@ tri vé so lin thay déi niy wong mang. ‘Vi du trén khi chug trinh chay s® cho két quit: ‘The number of changes = 2 Céu 24, (1.54), Cho file “input.tst” wong dé ein edie sé nguyén duong. Viét chuomg trinh doc cde sb tir file “input.txt” va ghi ra file “output.txt” céc s6 chin c6 trong file “input.txt” Hinh sau minh hoa di figu trong file input.xt va két qua file xuat ra file output.ist input.txt ‘output.txt S87 10 18 13 20 8 WO 18 20 Ghi-chi: phin wr lndn duce céng thém t0i da | diém cho phong cach lap trinh ~- HET IL Cac eau hoi dien ket qua (2d) (Cau 17, Cho bidt him sau dy tinh gid tri gi? int kiemrra2(int n) { ££ (n==0) return if ((n83—0) | | (nte. return kiemtra(n-1); 1 Bip dn: Téng cic sé nguyén tir | dén n. (Dé nay t6i copy ti dé ce thily goi v8 ma quén kigm tra lai tn him kiemtra2, nbumg khi true dé thi SV c6 hoi va tj d& digu chinh tai lip. Tuy nién, néu c6 SV tra 10i 1a khdng cb him Keientra thi cdc thay cin nbc gitim) (Cau 18, Hay doe vi gidi thich ham sau diy lim gi? woid kiemtra2(int a[],int n) { dint max,i,j,temp; max=(n<6) 2n-1:5; for (i=0;i

    You might also like