BCA 2nd sem SAD hindi notes

-

BCA SAD subject hindi notes unit wise click on link to view the notes  BCA 2nd sem SAD Hindi notes link /

Comments

Post a Comment

Popular posts from this blog

DWDM 2024 question paper with solution

-
Image
  Question paper DWDM  2024.    https://www.abesit.in/wp-content/uploads/2024/11/KOE093-DATA-WAREHOUSING-DATA-MINING.pdf Solution DWDM 2024  Solution of DWDM paper 2024 SECTION A – Attempt all questions in brief (2 marks each) a. Define Data Warehousing. A data warehouse is a centralized repository that stores integrated data from multiple sources, enabling analysis, reporting, and decision-making. b. Discuss the Fact Constellation. Fact Constellation is a schema that contains multiple fact tables sharing dimension tables, also known as galaxy schema, suitable for complex databases. c. Explain Distributed DBMS implementation. A Distributed DBMS manages a database distributed across multiple locations, ensuring transparency, consistency, and coordination of data across sites. d. Define Warehousing Software. Warehousing software is a tool or application used to construct, manage, and access a data warehouse for efficient data integration, analysis, and reporting....
Read more

binary search program in c language

-
https://www.programiz.com/online-compiler/9F3XFw8LL9vB5  //Program binary search in C language  #include <stdio.h> int main() { printf("Program for Binary search \n"); int a[]={2, 4, 6, 8, 10, 12, 14}; int key,i; int n=sizeof(a)/sizeof(a[0]); int l=0, r=n-1, mid=0; mid=(l+r)/2; printf("\narray elements are"); for(i=0;i<n; i++) {     printf("\t %d",a[i]); } printf("\n length of array=%d",n); printf("\n enter serach value="); scanf("%d",&key); while(l<=r) {  mid=(l+r)/2;     if(a[mid]==key)     {          printf("search key= %d found at index %d \n", key,mid );                break;     }     else if(a[mid]<key)     {         l=mid+1;     }     else     {         r=mid-1;     } } if(l>r) {    printf("search key= %d not found in array \n", ke...
Read more

Find minimum spanning tree using kruskal algorith in c Language

-
 #include <stdio.h> int find(int i, int parent[]) {     while (parent[i] != i)         i = parent[i];     return i; } void union_set(int i, int j, int parent[]) {     int a = find(i, parent);     int b = find(j, parent);     parent[b] = a; } void kruskal(int n, int edges[20][3], int e) {     int parent[20];     int i, j, u, v, cost = 0, count = 0;     // Step 1: MakeSet(v) → initialize parent[i] = i     for (i = 1; i <= n; i++)         parent[i] = i;     // Step 2: Sort edges in ascending order of weight     for (i = 0; i < e - 1; i++) {         for (j = i + 1; j < e; j++) {             if (edges[i][2] > edges[j][2]) {                 int temp0 = edges[i][0];                 int temp1 = ed...
Read more