LATEST TECHNOLOGIES

ANSYS
https://youtu.be/MTsA3B1k3_Y?si=jAGhhWoK7Vost9yB

Data Structures 
https://www.youtube.com/watch?v=Txixd9SSCfI&list=PL92RPe36fLKiIDI15iPOE5bGLvO27pb3p

Data structures in C

Day 0  https://youtu.be/BuwN39pWuqQ?si=vvekn5vSoW5RwjMo DAY 0

Day 1 https://youtu.be/H9l4l0o6DrQ?si=O4tTyVjuWZF2Y4bR DAY 1

Day 2 https://youtu.be/_S7piWlyMqI?si=qv8-gBtx7K9ftrBy DAY 2

Day 3 https://youtu.be/lVtZo0SIE4I?si=lnA4Rr3t4VZJ7dqV DAY 3

Day 4 https://youtu.be/TDEVmeJu7vQ?si=rHNya81Yi5tCUJsP DAY 4

Day 5 https://youtu.be/H9l4l0o6DrQ?si=9dcmDUeKEAe-T0CR DAY 5

Day 6 

Comments

Post a Comment

Popular posts from this blog

tcs1dsu

 #include <stdio.h> int main() { int n, s = 0, t, i, j; scanf("%d", &n); int arr[n]; for (i = 0; i < n; i++) scanf("%d", &arr[i]); for (i = 0; i < n; i++) for (j = 0; j < n - i - 1 && (s++, arr[j] > arr[j + 1]); j++) t = arr[j], arr[j] = arr[j + 1], arr[j + 1] = t; printf("%d\n", s); return 0; }
Read more

tcs1c

 #include <stdio.h> int main() {     int n, s = 0, t, i, j;     scanf("%d", &n);     int arr[n];     for (i = 0; i < n; i++) scanf("%d", &arr[i]);     for (i = 0; i < n; i++) for (j = 0; j < n - i - 1; j++) if (arr[j] > arr[j + 1]) s++, t = arr[j], arr[j] = arr[j + 1], arr[j + 1] = t;     printf("%d\n", s);     return 0; }
Read more