Wednesday, 2 April 2025
Sunday, 16 March 2025
Basic OS, Programing, Networking
This link has very excellent videso
1) https://www.softprayog.in/programming?_gl=1*teceo*_up*MQ..*_ga*MTQ2NDAxOTk5MC4xNzQyMTgyMTMy*_ga_FCCV8H99ZE*MTc0MjE4MjEzMi4xLjEuMTc0MjE4MjIxNi4wLjAuMA..
2) https://stackoverflow.com/questions/8639150/is-pthread-library-actually-a-user-thread-solution
3) https://www.youtube.com/watch?v=dx98pqJvZVk
4) https://www.programiz.com/c-programming/online-compiler/
5) https://en.wikipedia.org/wiki/Executable_and_Linkable_Format
Timers
6) https://www.youtube.com/watch?v=o54jmIr1xLg
7) https://www.youtube.com/watch?v=AftX7rqx-Uc
8) Multi core/cache coherence
https://www.youtube.com/watch?v=dx98pqJvZVk
9) multi thread (mutex, conditional var)
https://www.w3resource.com/c-programming/c-multithreading.php
9) vritual Memory
https://www.youtube.com/watch?v=A9WLYbE0p-I&t=179s
Few sample programs
================
1)Print number of parenthis combinations.
#include <stdio.h>
#define MAX_OUTPUT_SIZE 200
#define MAX_PARENT 5
void _printParenthesis(int pos, int n, int open, int close);
void printParenthesis(int n)
{
if (n > 0)
_printParenthesis(0, n, 0, 0);
return;
}
void _printParenthesis(int pos, int n, int open, int close)
{
static char str[MAX_OUTPUT_SIZE];
if (close == n) {
printf("%s \n", str);
return;
}
else {
if (open > close) {
str[pos] = '}';
_printParenthesis(pos + 1, n, open, close + 1);
}
if (open < n) {
str[pos] = '{';
_printParenthesis(pos + 1, n, open + 1, close);
}
}
}
int main()
{
int n = MAX_PARENT;
printParenthesis(n);
getchar();
return 0;
}
Wednesday, 14 December 2022
Cloud BNG
1) TR-459
2) cups Arch
Source: https://www.youtube.com/watch?v=frBtjQawUB0
Source: https://carrier.huawei.com/~/media/CNBG/Downloads/track/CU-Separated-BNG-Architecture_EN.pdf