Видео

That reeverb tho 😭😭

Worst video i have ever seen

Print square of numbers from 1 to 10 using "for" loop Ans: output = [value*value for value in range(1,11)] print(output)

Bhai tumne ye kese Bola kuch v samajh main Nahin aya, Sara Baat Upar Se Gaya 😅

It was really helpful to find correct CPU scheduling algorithm codes with explanation. I found your codes first by google search. There isn't any other place having all algorithms codes covered comprehensively. Excellent work!

Can you send this written notes please

great work sir ..

Amazing videos ❤❤

veryyyyy helpful!!!!!!

bhai notes mil sakte h ye?

Superb superb explanation. My question is how to delete if inode is full?

how to download the ppt for reference

Passing my mid bcz of your examples. Thank you.

Shortcut to clear shell in comand prompt windows

great video thanks. I am seen an issue with 2nd connection is not going thru, soon after closing the first connection. in my case, source port is same for both connection. so likely case is server in TIME_WAIT for that 2MSL, in that duration, the 2nd connection is attempted so quickly. i have no access to server, so have to work around on client side, may be have to put a sleep 2 mins between the two connections. thanks.

Hello Shivam, you are a great tutor. could you please start SRE interview series according to current market

bhai please add the notes drive link in description. it will easy to revise again

Or go to notepad and write: @echo off :a start goto a And save it as a batch (.bat) file

WOW, thank you for your effort. I just started to check your videos but I already see that the presentation and explanation are the best I have ever seen on RUclips. Good job !!!

Thank you so much.. I was so much frustrated but this video helped me a lot thank you loads.. You are my life saviour. I got the correct answer in one time only.. lots of love...

How do you stop it?😂

Bhai fone silent kar liyo

Great bro, If this library will work in my project , I will definetly donate you some amont.

bad.

USA 🇺🇸 Anything for our flag

Hi,

Thanks for such good explanation

great video thank you!

Thanks Nice Explanation..

# program 3 l=['a','e','i','o','u'] x=input() If x in l: print ('Vowel') else: print ('Consonant')

The link you provided in the Description is no longer available..!

Let me tell you, you helped me, so many lengthy videos, so much shit, but finally some clear crisp example and notes which also inform what actually is "Progress" and "bounded waiting" etc. I was so confused in "Progress" and "bounded waiting" my god. Thanks for the help!!

Thank you so much sir❤❤

thanks :)

very nice explanation !!

concept clear🙂🙂

hi

Sir, can you share these slides?

so even when the child gets terminated the left overs of child in pcb is termed as zombie right

Hi

Boleh minta codingan kak

Don't try this at home Me: *try this in a café*

Cost

Hi

Love you ❤

Hi

code kr k dikhawoh..

Thank you sir it was very helpful, great explanation

//Primitive-priority scheduling algorithm implementation using c program #include<stdio.h> #include<limits.h> int jtime = 0; int counter; int n; int at[20], bt[20], ct[20], pt[20], sts[20]; void process_Ps() { int index = -1; // variable for storing the index of the process with the highest priority int highestPriority = INT_MAX; // set the highest priority to the maximum possible value // Check all incomplete processes for (int i = 0; i < n; i++) { if (at[i] <= jtime && sts[i] != 1) // Check for incomplete processes with arrival time less than or equal to jtime { if (pt[i] < highestPriority) // Check if the process has higher priority { highestPriority = pt[i]; index = i; } } } if (index != -1) { // Process the selected process if (bt[index] > 0) { bt[index]--; jtime++; } // If the process is completed if (bt[index] == 0) { ct[index] = jtime; sts[index] = 1; // Set the status to completed counter--; // Decrement the counter since one process is completed } } else //if an index not gets { jtime++; // Increment jtime if no process is available at the current time } } // Main Function int main() { // Reading the number of processes printf("Enter the number of processes: "); scanf("%d", &n); counter = n; // Setting the counter to n // Reading process details from the user for (int i = 0; i < n; i++) { printf("Process %d: ", i + 1); printf("Arrival time: "); scanf("%d", &at[i]); printf("Burst time: "); scanf("%d", &bt[i]); printf("Priority: "); scanf("%d", &pt[i]); sts[i] = 0; // Setting the status of the process to incomplete ct[i] = 0; // Setting the completion time to zero at the beginning } // Printing the given details printf("Given details: "); printf("AT BT PT "); for (int i = 0; i < n; i++) { printf("%d %d %d ", at[i], bt[i], pt[i]); } // Perform process_Ps() function until the counter becomes zero, indicating that all processes are completed while (counter != 0) { process_Ps(); } // Display the results printf(" Results: "); printf("AT BT PT CT "); for (int i = 0; i < n; i++) { printf("%d %d %d %d ", at[i], bt[i], pt[i], ct[i]); } return 0; }