C++ Programs | Student Projects https://studentprojects.in Microcontroller projects, Circuit Diagrams, Project Ideas Sat, 10 Dec 2022 04:52:03 +0000 en-US hourly 1 https://wordpress.org/?v=6.1.7 Program to implement Kruskal algorithm in c++ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/program-to-implement-kruskal-algorithm-in-c/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/program-to-implement-kruskal-algorithm-in-c/#respond Tue, 24 May 2022 08:55:07 +0000 http://studentprojects.in/?p=4338 // kruskal minimum spanning tree #include<iostream.h> #include<conio.h> //structure for graph struct str { int edge, n1, n2; } s0[20], s1[20]; //structure for checking nodes struct st { int val, flag; } s2[20]; void input(); void filter(); void sort(); void min(); void update(int, int, int); int n, e, cnt = 0, Tcost = 0; int link[10][10]; void main() { clrscr(); input(); cout << “this is filtered output\ n”; filter(); cout << “this is sorted output\ n”; sort(); min(); cout << “\nTcost is“ << Tcost; getch(); } void input() { cout << “enter no.of nodes and edges\ n”; cin >> n >> e; cout << “enter input for upper triangle matrix\ n”; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != j && j > i) { cout << “enter link of node“ << i << ”to node“ << j << endl; cin >> link[i][j]; } else { if (i == j) link[i][j] = 0; else link[i][j] = link[j][i]; } } } } int k = 0, count = 0; void filter() { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (link[i][j] != 0) { s0[k].edge = link[i][j]; s0[k].n1 = i; s0[k].n2 = j; k++; count++; } } } i = 0; int j = 0; int flag = 1; for (int l = 0; l < count; l++) { if (i == 0) { s1[j].edge = s0[i].edge; s1[j].n1 = s0[i].n1; s1[j].n2 = s0[i].n2; i++; j++; } else { k = 0; while (k < j) { if (s1[k].edge == s0[i].edge && s1[k].n1 == s0[i].n2 && s1[k].n2 == s0[i].n1) { flag = 0; break; } else k++; } if (flag) { s1[j].edge = s0[i].edge; s1[j].n1 = s0[i].n1; s1[j].n2 = s0[i].n2; i++; j++; cnt++; } else { i++; flag = 1; } } } for (i = 0; i <= cnt; i++) cout << s1[i].edge << “\t” << s1[i].n1 << “\t” << s1[i].n2 << endl; } void sort() { for (int i = 0; i <= cnt - 1; i++) { for (int j = 0; j <= cnt - i - 1; j++) { if (s1[j].edge > s1[j + 1].edge) { int t = s1[j].edge; s1[j].edge = s1[j + 1].edge; s1[j + 1].edge = t; int t1 = s1[j].n1; s1[j].n1 = s1[j + 1].n1; s1[j + 1].n1 = t1; int t2 = s1[j].n2; s1[j].n2 = s1[j + 1].n2; s1[j + 1].n2 = t2; } } } for (i = 0; i < cnt; i++) cout << s1[i].edge << “\t” << s1[i].n1 << “\t” << s1[i].n2 << endl; } void min() { //initialize s2 structure for (int i = 0; i < n; i++) { s2[i].val = i; s2[i].flag = i + 1; } int u, v, y, z; int cur = n; for (i = 0; i < e; i++) { y = s1[i].n1; z = s1[i].n2; //cout<<“y & z “<<y<<z; u = s2[y].flag; v = s2[z].flag; if (u != v) { Tcost += s1[i].edge; cout << “\nedge“ << y << “– > ” << z; } cur = cur + 1; update(y, z, cur); } } void update(int y, int z, int cur) { for (int i = 0; i < n; i++) { if (i != y) { if (s2[y].flag == s2[i].flag) s2[i].flag = cur; } if (i != z) { if (s2[z].flag == s2[i].flag) s2[i].flag = cur; } } s2[y].flag = cur; s2[z].flag = cur; }

The post Program to implement Kruskal algorithm in c++ first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/program-to-implement-kruskal-algorithm-in-c/feed/ 0 How to count set bits in a number https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-count-set-bits-in-a-number/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-count-set-bits-in-a-number/#respond Tue, 12 Apr 2022 14:10:24 +0000 https://studentprojects.in/?p=9042 First version: int CoutSetBits(int Num) { for (int count = 0; Num; Num >>= 1) { if (Num & 1) count++; } return count; } Optimized version: int CoutSetBits(int Num) { for (int count = 0; Num; count++) { Num &= Num - 1; } }

The post How to count set bits in a number first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-count-set-bits-in-a-number/feed/ 0 How to return Nth the node from the end of the linked list in one pass https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-return-nth-the-node-from-the-end-of-the-linked-list-in-one-pass/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-return-nth-the-node-from-the-end-of-the-linked-list-in-one-pass/#respond Tue, 12 Apr 2022 14:07:44 +0000 https://studentprojects.in/?p=9040 Node * GetNthNode(Node * Head, int NthNode) { Node * pNthNode = NULL; Node * pTempNode = NULL; int nCurrentElement = 0; for (pTempNode = Head; pTempNode != NULL; pTempNode = pTempNode -> pNext) { nCurrentElement++; if (nCurrentElement - NthNode == 0) { pNthNode = Head; } else if (nCurrentElement - NthNode > 0) { pNthNode = pNthNode -> pNext; } } if (pNthNode) { return pNthNode; } else return NULL; }

The post How to return Nth the node from the end of the linked list in one pass first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-return-nth-the-node-from-the-end-of-the-linked-list-in-one-pass/feed/ 0 How to write a function that finds the last instance of a character in a string https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-finds-the-last-instance-of-a-character-in-a-string/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-finds-the-last-instance-of-a-character-in-a-string/#respond Tue, 12 Apr 2022 14:06:02 +0000 https://studentprojects.in/?p=9038 char * lastchar(char * String, char ch) { char * pStr = NULL; // traverse the entire string while ( * String++ != NULL) { if ( * String == ch) pStr = String; } return pStr; }

The post How to write a function that finds the last instance of a character in a string first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-finds-the-last-instance-of-a-character-in-a-string/feed/ 0 How to generate a Fib numbers https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-generate-a-fib-numbers/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-generate-a-fib-numbers/#respond Tue, 12 Apr 2022 14:04:49 +0000 https://studentprojects.in/?p=9036 int fib( n ) // recursive version { if ( n < 2 ) return 1; else return fib ( n –1 ) + fib ( n –2 ); } int fib( n ) //iterative version { int f1 =1, f2 = 1; if ( n < 2 ) return 1; for ( i = 1; i < N; i++) { f = f1 + f2; f1= f2; f = f1; } return f; }

The post How to generate a Fib numbers first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-generate-a-fib-numbers/feed/ 0 How to find the factorial of a number https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-find-the-factorial-of-a-number/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-find-the-factorial-of-a-number/#respond Tue, 12 Apr 2022 14:03:50 +0000 https://studentprojects.in/?p=9034 // // recursive version // int Factorial(int Num) { If(num > 0) return Num * Factorial(Num– 1); else return 1; } // // iterative version // int Factorial(int Num) { int I int result = 1; for (I = Num; I > 0; I--) { result = result * I; } return result; }

The post How to find the factorial of a number first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-find-the-factorial-of-a-number/feed/ 0 How to print an integer using only putchar https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-print-an-integer-using-only-putchar/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-print-an-integer-using-only-putchar/#respond Tue, 12 Apr 2022 13:48:51 +0000 https://studentprojects.in/?p=9032 // // recursive version // void PrintNum(int Num) { if (Num == 0) return; PrintNum(Num / 10); Puthcar(‘0’ + Num % 10); }

The post How to print an integer using only putchar first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-print-an-integer-using-only-putchar/feed/ 0 How to print a data from a binary tree in-order(ascending) https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-print-a-data-from-a-binary-tree-in-orderascending/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-print-a-data-from-a-binary-tree-in-orderascending/#respond Tue, 12 Apr 2022 13:47:37 +0000 https://studentprojects.in/?p=9030 // // recursive version // Void PrintTree(struct * node node) { if (node == NULL) return; PrintTree(node -> left); Printf(“ % d”, node -> data); PrintTree(node -> right); }

The post How to print a data from a binary tree in-order(ascending) first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/how-to-print-a-data-from-a-binary-tree-in-orderascending/feed/ 0 How to write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-takes-in-a-string-parameter-and-checks-to-see-whether-or-not-it-is-an-integer-and-if-it-is-then-return-the-integer-value/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-takes-in-a-string-parameter-and-checks-to-see-whether-or-not-it-is-an-integer-and-if-it-is-then-return-the-integer-value/#respond Tue, 12 Apr 2022 13:45:49 +0000 https://studentprojects.in/?p=9028 #include <stdio.h> int strtoint(char * s) { int index = 0, flag = 0; while ( * (s + index) != '\0') { if (( * (s + index) >= '0') && * (s + index) <= '9') { flag = 1; index++; } else { flag = 0; break; } } if (flag == 1) return atoi(s); else return 0; } main() { printf("%d", strtoint("0123")); printf("\n%d", strtoint("0123ii")); }

The post How to write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-basic/how-to-write-a-function-that-takes-in-a-string-parameter-and-checks-to-see-whether-or-not-it-is-an-integer-and-if-it-is-then-return-the-integer-value/feed/ 0 How to multiply a number by 7 without using * and + operator https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/how-to-multiply-a-number-by-7-without-using-and-operator/ https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/how-to-multiply-a-number-by-7-without-using-and-operator/#respond Tue, 12 Apr 2022 13:41:06 +0000 https://studentprojects.in/?p=9024 NewNum = Num << 3; // multiplied by 2 ^ 3 = 8 NewNum = NewNum - Num; // 8 – 1 = 7

The post How to multiply a number by 7 without using * and + operator first appeared on Student Projects.

]]> https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/how-to-multiply-a-number-by-7-without-using-and-operator/feed/ 0