Skip to main content

Posts

Windows 11 Pro Activation Key

 Windows 11 Pro key: W269N-WFGWX-YVC9B-4J6C9-T83GX Windows 11 Pro N key: MH37W-N47XK-V7XM9-C7227-GCQG9 Windows 11 Pro Workstations key: NRG8B-VKK3Q-CXVCJ-9G2XF-6Q84J Windows 11 Pro Workstations N key: 9FNHH-K3HBT-3W4TD-6383H-6XYWF Windows 11 Pro Education key: 6TP4R-GNPTD-KYYHQ-7B7DP-J447Y Windows 11 Home key: TX9XD-98N7V-6WMQ6-BX7FG-H8Q99 Windows 11 Home N key: 3KHY7-WNT83-DGQKR-F7HPR-844BM Windows 11 Home Home Single Language key: 7HNRX-D7KGG-3K4RQ-4WPJ4-YTDFH Windows 11 Home Country Specific: PVMJN-6DFY6-9CCP6-7BKTT-D3WVR Windows 11 Education key: NW6C2-QMPVW-D7KKK-3GKT6-VCFB2 Windows 11 Education N: 2WH4N-8QGBV-H22JP-CT43Q-MDWWJ Windows 11 Enterprise key: NPPR9-FWDCX-D2C8J-H872K-2YT43 Windows 11 Enterprise N key: DPH2V-TTNVB-4X9Q3-TJR4H-KHJW4 Windows 11 Enterprise G: YYVX9-NTFWV-6MDM3-9PT4T-4M68B Windows 11 Enterprise G N: 44RPN-FTY23-9VTTB-MP9BX-T84FV Windows 11 Enterprise LTSC 2019 key: M7XTQ-FN8P6-TTKYV-9D4CC-J462D Windows 11 Enterprise N LTSC 2019 key: 92NFX-8DJQP-P6BBQ-THF9C-7
Recent posts

Create Private folder in windows

 @ECHO OFF if EXIST "Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}" goto UNLOCK if NOT EXIST Private goto MDPrivate :CONFIRM echo Are you sure to lock this folder? (Y/N) set/p "cho=>" if %cho%==Y goto LOCK if %cho%==y goto LOCK if %cho%==n goto END if %cho%==N goto END echo Invalid choice. goto CONFIRM :LOCK ren Private "Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}" attrib +h +s "Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}" echo Folder locked goto End :UNLOCK echo Enter password to Unlock Your Secure Folder set/p "pass=>" if NOT %pass%== 121 goto FAIL attrib -h -s "Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}" ren "Control Panel.{21EC2020-3AEA-1069-A2DD-08002B30309D}" Private echo Folder Unlocked successfully goto End :FAIL echo Invalid password goto end :MDPrivate md Private echo Private created successfully goto End :End RAW Paste Data @ECHO OFF if EXIST "Control Panel.{21

Write a C Program for All-Pairs Shortest Paths using Floydd’s Algorithm

  #include<stdio.h> #include<conio.h> int min(int,int); void floyds(int p[10][10],int n) {                 int i,j,k;                 for (k=1;k<=n;k++)                   for (i=1;i<=n;i++)                    for (j=1;j<=n;j++)                     if(i==j)                      p[i][j]=0; else                      p[i][j]=min(p[i][j],p[i][k]+p[k][j]); } int min(int a,int b) {                 if(a<b)                   return(a); else                   return(b); } void main() {                 int p[10][10],w,n,e,u,v,i,j;                     printf("\n Enter the number of vertices:");                 scanf("%d",&n);                 printf("\n Enter the number of edges:\n");                 scanf("%d",&e);                 for (i=1;i<=n;i++) {                                 for (j=1;j<=n;j++)                                    p[i][j]=999;                 }

Write a C Program for Single Source Shortest Paths using Dijkstra’s Algorithm

  #include<stdio.h>   #include<conio.h>   #define INFINITY 9999   #define MAX 10   void dijkstra(int G[MAX][MAX],int n,int startnode);   int main()   {           int G[MAX][MAX],i,j,n,u;         printf("Enter no. of vertices:");       scanf("%d",&n);       printf("\nEnter the adjacency matrix:\n");       for(i=0;i<n;i++)       for(j=0;j<n;j++)       scanf("%d",&G[i][j]);       printf("\nEnter the starting node:");       scanf("%d",&u);       dijkstra(G,n,u);       getch();       return 0;   }   void dijkstra(int G[MAX][MAX],int n,int startnode)   {       int cost[MAX][MAX],distance[MAX],pred[MAX];       int visited[MAX],count,mindistance,nextnode,i,j;       //pred[] stores the predecessor of each node       //count gives the number of nodes seen so far       //create the cost matrix  

Write a C Program that uses functions to perform the following operations on a Binary Tree Creation, Insertion, Deletion

  #include<stdio.h>   #include<conio.h> #include<stdio.h> struct tree {                 int info;                 struct tree *left;                 struct tree *right; }; struct tree *insert(struct tree *,int); void inorder(struct tree *); void postorder(struct tree *); void preorder(struct tree *); struct tree *delet(struct tree *,int); struct tree *search(struct tree *); int main(void) {                 struct tree *root;                 int choice, item,item_no;                 root = NULL;                   /* rear   = NULL;*/                 do {                                 do {                                                 printf("\n \t 1. Insert in Binary Tree   ");                                                 printf("\n\t 2. Delete from Binary Tree ");                                                 printf("\n\t 3. Inorder traversal of Binary tree");                    

Write a C Program that uses functions to perform the following operations on a double linked list Creation, Insertion, Deletion

  #include<stdio.h>   #include<stdlib.h>   struct node   {                   struct node *prev;   struct node *next;   int data;   };   struct node *head;   void insertion_beginning();   void insertion_last();   void deletion_beginning();   void deletion_last();   void display();   void search();   void main ()   {   int choice =0;   while(choice != 9)   {   printf("\nMain Menu\n");   printf("\nChoose one option:\n");     printf("\n1.Insert in Beginning\n2.Insert at last\n3.Delete from Beginning\n4.Delete from last\n5.Search\n6.Show\n7.Exit\n");   printf("\nEnter your choice?\n");   scanf("\n%d",&choice);   switch(choice)     {   case 1:   insertion_beginning();   break;   case 2:   insertion_last();   break;   case 3:   deletion_beginning();   break;   case 4:   deletion_last();   break;   case 5:   search();   break;   case 6:   dis