Tabbas! Ga labarin da kuka nema:

Fahimtar rikitattun abubuwan gano tsari wani muhimmin al'amari ne na saka idanu na telemetry a ƙirar tsarin. Mai gano tsari (PID) lamba ce ta musamman da aka sanya wa kowane tsari lokacin da ta fara kan tsarin Unix kamar waɗanda aka gina a cikin yaren C.

Ɗaya daga cikin ayyukan da aka bi don dawo da PID shine aikin samun aiki. Rubutun yana da sauƙi mai sauƙi, saboda baya buƙatar kowane sigogi, kuma bi da bi, kawai yana dawo da ƙimar lamba, wakiltar PID na tsarin yanzu. Yanzu bari mu zurfafa cikin yadda za mu iya samun PID ta hanyar tsari a cikin C.

    #include <stdio.h>
    #include <unistd.h>

    int main() {
        printf("The process ID is %dn", getpid());
        return 0;
    }

Bayan haɗa da dakunan karatu masu mahimmanci, mun ayyana babban aikin. A cikin babban aikin, muna da umarnin bugawa mai sauƙi wanda ke fitar da "ID ɗin tsari" yana biye da ainihin PID, wanda aka dawo da shi ta hanyar aikin samun.

Muhimmancin Gane Tsari

Ganewar tsari yana da mahimmanci yayin da yake ba da damar ingantacciyar sadarwa da amintacciyar sadarwa tsakanin matakai daban-daban a cikin tsarin. Yana tabbatar da cewa an rarraba albarkatun daidai da sarrafa su a cikin matakai daban-daban. Idan ba tare da PIDs ba, gudanarwa da bambance tsarin tsarin zai zama babban ƙalubale idan ba aiki mai yiwuwa ba.

An Yi Amfani da Dakunan karatu

A cikin lambar mu, mun yi amfani da mahimman ɗakunan karatu guda biyu don samun PID:

• stdio.h: Wannan fayil ne na kan kai wanda yawanci ya ƙunshi ayyana saitin ayyuka da suka haɗa da ayyukan shigarwa/fitarwa.
• unistd.h: Yana tsaye don daidaitaccen ɗakin karatu na Unix, yana ƙunshe da ma'anoni masu mahimmanci da sanarwa don aiwatar da kiran tsarin.

Don zurfafa fahimtarmu, ku tuna cewa ɗakunan karatu suna ba da lambar da aka riga aka haɗa waɗanda za a iya sake amfani da su, ceton masu haɓakawa daga sake rubuta hadaddun lambobi. Misali, stdio.h yana ba mu hanya mai sauƙi don mu'amala tare da na'urorin shigarwa ko fitarwa yayin da unistd.h ke taimaka mana wajen yin kiran tsarin ba tare da sanin abubuwan da ke cikin tsarin ba.

Kara karantawa

Ƙirƙirar Lambobin Random tsakanin 2 a cikin Harshen Shirye-shiryen C

Ƙarfin ƙirƙira lambobin bazuwar na iya zama mahimmanci a wasu nau'ikan ayyuka na shirye-shiryen kwamfuta, musamman a ƙirar algorithm ko kuma inda ake buƙatar simulation. A cikin wannan labarin, za mu shiga cikin wani muhimmin al'amari na shirye-shiryen C, wanda ke samar da lambobi bazuwar. Za mu ɗauka cewa kuna da ainihin fahimtar harshen shirye-shirye na C. C shine harshe na gaba ɗaya mai ƙarfi wanda ke ba masu shirye-shirye ƙarin iko da inganci, kasancewa masu kyau ga shirye-shirye a ƙaramin matakin

Kara karantawa

Tabbas, bari mu fara!

Buga da ruwan hoda Bayanin bugu ne mai launin ruwan hoda kayan rubutu a cikin shirye-shiryen C. Wannan aikin shirye-shirye ba abu ne na kowa ba, amma yana da ban sha'awa sosai kuma yana nuna nau'i-nau'i da sassaucin ra'ayi na C. Ayyukan na musamman ne amma yana ba ku damar fahimtar yadda za ku yi amfani da tsarin nunin tashar tashar don cimma shi.

Kara karantawa

A cikin shirye-shiryen C, gudanar da ayyuka tare da muhawara masu mahimmanci yana da mahimmanci. Ka yi tunanin aiwatar da aikin da ke karɓar adadin mahawara masu yawa. Shin hakan ba zai nuna alamar lambar ku ta daidaita da buƙatun aikace-aikacen ba, don haka haɓaka sassauci da aikinta? A yau, za mu nutse cikin irin wannan kyakkyawan fasalin da harshen shirye-shirye C ya bayar - va_list - a cikin wani fasali a cikin ɗakin karatu na stdarg.h da ake amfani da shi don sarrafa irin waɗannan ayyuka.

Kara karantawa

Tabbas, bari mu fara da labarin:

myFgets yana ɗaya daga cikin mahimman ayyuka a cikin C don samun shigarwa daga mai amfani. Wani yanki ne na ɗakin karatu na stdio kuma ya fito a matsayin madadin mafi aminci ga sauran takwarorinsa kamar scanf, saboda iyawar sa na hana buffer ambaliya.

#include <stdio.h>

#define SIZE 100

int main()
{
    char str[SIZE];

    printf("Enter a string: ");
    if(fgets(str, SIZE, stdin) != NULL)
    {
        printf("You entered: ");
        puts(str);
    }

    return 0;
}

Bayan farawa tare da taƙaitaccen gabatarwa game da myFgets, lambar C da aka bayar a sama tana amfani da aikin myFgets don samun shigar da kirtani daga mai amfani.

Ta yaya myFgets ke aiki?

Ayyukan fgets shine karanta kirtani daga daidaitaccen shigarwar (stdin), yawanci madannai. Ayyukan fgets baya bambanta da sauran ayyukan shigarwa a cikin C a cikin buƙatun sa don sigogi uku: buffer don karanta shigarwar cikin, matsakaicin girman buffer, da rafin shigarwa don karantawa daga. Musamman, bayan karanta kirtani, fgets yana ƙara halayen banza ('') zuwa ƙarshe.

Fahimtar lambar da ke sama

Aikin da aka ayyana a sama yana farawa ta hanyar ayyana kirtani (char array) na takamaiman girman (SIZE). Daga nan sai ya sa mai amfani ya shigar da igiya. Bayan shigarwar mai amfani, bayanin sharadi yana bincika ko aikin fgets ya sami damar karanta kirtani. Idan zai iya, yana ci gaba da buga wannan kirtani baya zuwa allon ta amfani da aikin sakawa.

A fahimtar alakar da ke tsakanin fgets, girman buffer da hana cikar buffer, yana da mahimmanci a gane cewa adadin haruffan da fgets ke karantawa ɗaya ne ƙasa da ƙayyadadden SIZE. Ana yin wannan don daidaita halin banza a ƙarshen shigarwar.

Dakunan karatu da ayyuka masu dacewa

Dangane da dakunan karatu, stdio.h yana ɗaya daga cikin manyan ɗakunan karatu a cikin C, ana amfani da su don ayyukan shigarwa/fitarwa. Yanayin amfani yana da sauƙi kamar haɗa shi a farkon lambar C ta amfani da umarnin #include.

Game da ayyukan da aka yi amfani da su a cikin wannan lambar, fgets na wannan ɗakin karatu ne, tare da sakawa da bugawa. Yayin da fgets ke bincike, ana amfani da sakawa don rubuta kirtani don stdout har zuwa amma ban haɗa da halin banza ba. Printf ɗin aikin yana samar da kirtani na bayanai don fitarwa, bisa tsarin kirtani da muhawara.

Lura cewa don amintacciyar hanya mai inganci don shigar da kirtani daga mai amfani, myFgets yana da tabbataccen rikodin waƙa a cikin tsarin shirye-shiryen C, ta hanyar ɗaure girman shigarwar, don haka hana yuwuwar buffer ambaliya.

Kara karantawa

Tabbas, zan iya ɗaukar wannan aikin! Ga yadda zan fara labarin:

Rarraba algorithms wani muhimmin bangare ne na kimiyyar kwamfuta da shirye-shirye saboda suna ba mu damar yin odar bayanai da kyau. Ɗaya daga cikin mafi sauƙi kuma mafi yawan dabarun rarrabuwa shine Bubble Sort, ƙayyadaddun tushen algorithm wanda akai-akai ta hanyar jeri, yana kwatanta abubuwan da ke kusa, da musanya su idan sun kasance cikin tsari mara kyau. Ana yin hanyar wucewa ta jeri-jeri akai-akai har sai ba a buƙatar musanyawa ba, yana nuna cewa an jera jeri.

Bubble Sort ba ingantaccen rarrabuwa ba ne don manyan jeri, amma saboda sauƙin sa, galibi ana koyar da shi a cikin gabatarwar darussan kimiyyar kwamfuta. Ko da yake matsakaicin lokaci da kuma mafi munin lokacin rikitarwa na O (n ^ 2) na iya sanya shi zaɓi mara kyau don manyan bayanan bayanai, har yanzu yana iya zama mai amfani a wasu lokuta masu amfani inda sauƙi da sauƙin aiwatarwa al'amarin fiye da ɗanyen aiki.

#include

vaid bubbleSort(int array[], int size) {
don (int mataki = 0; mataki < size - 1; ++ mataki) {don (int i = 0; i < size - mataki - 1; ++i) {idan (array[i]> tsararru[i + 1) ]) {
int temp = tsararru[i];
tsararru[i] = tsararru[i + 1];
tsararru[i + 1] = yanayin zafi;
}
}
}
}

m printArray (int tsararru[], girman int) {
don (int i = 0; i < size; ++i) printf("%d", tsararru[i]); printf("n"); } int main() {int data[] = {-2, 45, 0, 11, -9}; girman int = girman (bayanai) / girman (bayanai [0]); bubbleSort (bayanai, girman); printf ("Rarraba Tsara a Tsarin Haurawa: n"); printArray (bayanai, girman); dawo 0; } [/code]

Kara karantawa

Lokacin da muke magana game da rarrabuwa a cikin tsarin shirye-shirye, ana ɗaukarsa ɗayan ayyuka masu mahimmanci kuma galibi ana buƙata yayin haɓaka aikace-aikace. A kimiyyar kwamfuta, rarrabuwar algorithm wata hanya ce da ake amfani da ita don sake tsara abubuwan da ke cikin jeri a cikin takamaiman tsari, walau hawan hawan ko saukowa ko na ƙamus. A cikin wannan yanayin, za mu fi mai da hankali ne kan matsalar nau'ikan nau'ikan nau'ikan nau'ikan shirye-shiryen C, ayyukan sa, da yadda yake ba da ingantacciyar mafita.

#include
nau'in mara amfani (int array[], int n) {
don (int mataki = 0; mataki <n - 1; ++mataki) {int min_idx = mataki; don (int i = mataki + 1; i <n; ++i) {idan (array[i] <array[min_idx]) {min_idx = i; }} int temp = tsararru [min_idx]; tsararru [min_idx] = tsararru [mataki]; tsararru[mataki] = temp; } } [/code]

Kara karantawa

Rubuta aikace-aikacen a cikin C wanda ke bugawa kowane minti na yini na iya zama kamar ƙalubale mai ban sha'awa, musamman idan kun kasance mafari a cikin shirye-shirye. Abin farin ciki, yaren shirye-shiryen C yana ba da ɗimbin ɗakunan karatu da ayyuka waɗanda za mu iya amfani da su don magance wannan matsalar. Kafin shiga cikin maganin matsalar, yana da mahimmanci a fahimci abin da wannan aikin ya ƙunsa. Ainihin, makasudin anan shine rubuta shirin C wanda zai buga dukkan mintuna a cikin yini, daga 00:00 zuwa 23:59.

Kara karantawa