myblog.pk

JavaScript Must-Read Topics for Senior Developer Interviews Core JavaScript Variables and Scoping ( var , let , const ) ✅ Hoisting✅ Closures✅ The Event Loop✅ Promises✅ and Async/Await✅ Callbacks✅ Prototype and Prototypal Inheritance✅ this Keyword and Binding✅ Execution Context and Call Stack✅ Error Handling ( try-catch , finally , custom errors)✅ ES6+ Features (Destructuring✅, Spread/Rest✅, Arrow Functions✅, etc.) Type Coercion and Type Checking ✅ == vs ===  ✅ Object-Oriented Programming in JavaScript (Classes, Constructors)✅ Functional Programming Concepts (Higher-Order Functions✅, Pure Functions✅, Immutability✅) Module Systems ( require , import/export , CommonJS, ESModules)✅ JavaScript Design Patterns (Singleton, Factory, Observer, etc.) Garbage Collection✅ Advanced Topics Currying✅ Memoization✅ Throttling and Debouncing✅ Event Bubbling , Event Capturing and Event Delegation✅ Shadow DOM and Web Components Iterators, Iterables and Generator✅ WeakMap and WeakSet✅ Proxy and...

Recursive Selection sort : Program in C language #include<stdio.h> void selection_sort(int arr[],int start,int n) {     if(start>=n-1)     {         return;     }     int min_pos=start;     for(int i=start+1;i<n;i++)     {         if(arr[i]<arr[min_pos])         {             min_pos=i;         }     }     if(min_pos!=start)     {         int temp=arr[start];         arr[start]=arr[min_pos];         arr[min_pos]=temp;     }     selection_sort(arr,start+1,n); } void main() {     int n;     printf("Enter size of array:\n");     scanf("%d",&n);     int arr[n];     printf("Enter %d arra...

To implement MFT memory allocation algorithm Program in C: #include<stdio.h> void main() {     int m,p,s,p1;     int m1[4],i,f,f1=0,f2=0,fra1,fra2,s1;     printf("Enter the memory size:");     scanf("%d",&m);     printf("Enter the no of partitions:");     scanf("%d",&p);     s=m/p;     printf("Each partition size is:%d",s);     printf("\nEnter the no of processes:");     scanf("%d",&p1);     for(i=0;i<p1;i++)     {         printf("\nEnter the memory required for process %d:",i+1);         scanf("%d",&m1[i]);         if(m1[i]<=s)         {            printf("\nProcess is allocated in partition %d",i+1);            fra1=s-m1[i];            printf("\nI...

_________________________________________________________________________________ #include<stdio.h> #include<stdlib.h> #include<math.h> int result=0; int k=0; void add() {     int a;int b;     if(k==0)     {         printf("                        Enter two numbers :\n");         printf("                        ");         scanf("%d",&a);         printf("                        ");         scanf("%d",&b);         result=a+b;     }     else     {         printf("                        Enter a number\n"); ...