Tiêu đề অধ্যায় ৫_প্রোগ্রামিং ভাষা_With solve 01-03-25.pdf ✅

4 ........................................................................................................................................................................  ICT Chapter-5 Rhombus Publications cÖkœ6 #include stdio.h #include conio.h { int n, i, s = 0; printf ("Enter the value of n"); scanf("%d", & n); for (i = l, i  = n; i + = l) { s = s + i * (i + l); } printf("Sum =%d", s) getch ( ); } (K) K¤úvBjvi Kx? [Kz. †ev. 24] (L) wm †cÖvMÖv‡g †Kvb dvskb Avewk ̈K? e ̈vL ̈v Ki| [Kz. †ev. 24] (M) DÏxc‡Ki †cÖvMÖvgwUi Rb ̈ A ̈vjMwi`g †jL| [Kz. †ev. 24] (N) DÏxc‡Ki †cÖvMÖvgwU while jy‡ci mvnv‡h ̈ m¤úbœ Ki‡Z n‡jv †cÖvMÖv‡gi †Kv‡W Kx cwieZ©Y Ki‡Z n‡e Zv †jL| [Kz. †ev. 24] mgvavb: K K¤úvBjvi n‡jv GK ai‡bi Abyev`‡K ev nvB‡j‡f‡ji fvlvi wjwLZ †cÖvMÖvg‡K †gwkb fvlvq iƒcvšÍi K‡i| L main( ) dvskb n‡jv cÖwZwU wm †cÖvMÖvg MVbKvix cÖavb dvskb| main( ) dvskb Qvov wm †cÖvMÖvg †jLv m¤¢e bq| main ( ) dvsk‡bi `ywU Ask _v‡K| GKwU Declaration part Ges Ab ̈wU Execution Part| Declarction Part- G cÖ‡qvRbxq PjK, A ̈v‡i, c‡q›Uvi, dvBj BZ ̈vw` †NvlYv Kiv nq hv wbe©vn As‡k e ̈envi Kiv n‡e| Execution part G †cÖvMÖvg wbevn© nIqvi Rb ̈ Kgc‡ÿ GKwU †÷U‡g›U _vK‡Z n‡e| Dfq As‡ki cÖ‡Z ̈K †÷U‡g‡›Ui †k‡l †mwg‡Kvjb (;) _vK‡Z n‡e| M DÏxc‡Ki †cÖvMÖvgwUi Rb ̈ A ̈vjMwi`g: avc-1: †cÖvMÖvg ïiæ Kwi| avc-2: BbcyU wn‡m‡e n Gi gvb MÖnY Kwi| avc-3: i = 1 I s = 0 awi| avc-4: hw` i  n nq Z‡e 5bs av‡c hvB Ab ̈_vq 7bs av‡c hvB| avc-5: s = s + i * (i + 1) wnmve Kwi| avc-6: i = i + 1 wnmve K‡i 4bs av‡c hvB| avc-7: djvdj wn‡m‡e s Gi gvb cÖ`k©b Kwi| avc-8: †cÖvMÖvg †kl Kwi| N DÏxc‡Ki †cÖvMÖvgwU while loop Gi mvnv‡h ̈ m¤úbœ Ki‡Z n‡j †cÖvMÖvgwUi †Kv‡W †h cwieZ©b Ki‡Z n‡e| #include > < stdio.h> int main() { int n, i = 1, s = 0; printf("Enter the value of n: "); scanf("%d",&n); while (i <= n) { s = s + i * (i + 1); i + = 1; } printf("Sum = %d\n", s); return 0; } cÖkœ7 `„k ̈Kí-1: 7, 10, 45, 20, 51, 23 `„k ̈Kí-2: Step 1 : Start Step 2 : Input a, b, c Step 3 : max = a Step 4 : if (max  b) max = b Step 5 : if (max  c) max = c Step 6 : print max Step 7 : End (K) dvskb Kx? [h. †ev. 24] (L) jwRK ̈vj Acv‡iUi ej‡Z Kx eyS? e ̈vL ̈v Ki| [h. †ev. 24] (M) `„k ̈Kí-2 Gi †d¬vPvU© AvuK| [h. †ev. 24] (N) `„k ̈Kí-1 Gi †WUv ̧‡jv GKwU A ̈v‡i‡Z wb‡q Zv‡`i †hvMdj C †cÖvMÖv‡gi gva ̈‡g †ei Kiv m¤¢e Ñ e ̈vL ̈v Ki| [h. †ev. 24] mgvavb: K hLb †Kv‡bv wbw`©ó KvR m¤úv`‡bi Rb ̈ KZ ̧‡jv †÷U‡g›U †Kv‡bv bv‡g GKwU eø‡Ki g‡a ̈ ivLv nq ZLb Zv‡K dvskb ejv nq| L wm †cÖvMÖv‡g wewfbœ ai‡bi jwRK ̈vj Acv‡ikb (jwRK ̈vj Ai, A ̈vÛ, bU) m¤úbœ Kivi Rb ̈ jwRK ̈vj Acv‡iUi e ̈envi Kiv nq| jwRK ̈vj Acv‡iU‡i mv‡_ GK ev GKvwaK †fwi‡qej A_ev A ̈vwi_‡gwUK G·‡cÖkb mn‡hv‡M jwRK ̈vj G·‡cÖkb •Zwi Kiv nq Ges jwRK ̈vj G·‡cÖk‡bi gvb (0) ev (1) Qvov wKQz n‡Z cv‡i bv| Logical OR (II) G·‡cÖk‡bi †h‡Kv‡bv GKwU Acv‡iÛ ture 1 n‡j G·‡cÖk‡bi gvb 1 n‡e Ab ̈_vq 0| Logical and G·‡cÖk‡bi mKj Acv‡iÛ 1 n‡j G·‡ck‡bi gvb 1| Ab ̈_vq 0 Logical not G·‡cÖk‡b ïay GKwU Acv‡iÐ wb‡q KvR nq, Acv‡iÛwU true n‡j G·‡cÖk‡bi gvb n‡e 0 Ab ̈_vq 1| M `„k ̈Kí-2 Gi †d¬vPvU© wb‡¤œ A1⁄4b Kiv n‡jv: Start Input a, b, c max < b End No max = a max = b max = c max < c Print max Yes max = a Yes No