GTU CSE

#include #include #define MAX 20 float final_profit; int w[MAX]; int p[MAX]; int n,m; int temp[MAX],x[MAX]; float final_wt; float Bound_Calculation(int,int,int); void BackTracking(int,int,int); void main() { int i; clrscr(); printf("\n-------------------------------------------------------"); printf("\n KNAPSACK PROBLEM USING BACKTRACKING"); printf("\n-------------------------------------------------------"); printf("\n Enter number of Objects you want:"); scanf("%d",&n); printf("\n-------------------------------------------------------"); for(i=1;i final_profit)&&(k==n)) { final_profit=new_cp; final_wt=new_cw; for(j=1;j =final_profit) { temp[k]=0; if(k final_profit)&&(k==n)) { final_profit=cp; final_wt=cw; for(j=1;j OUTPUT ------------------------------------------------------- KNAPSACK PROBLEM USING BACKTRACKING -------------------------------------...

#include #include #include int board[20]; int count; void print_board(int); void Queen(int,int); int place(int,int); void main() { int n,i,j; clrscr(); printf("\n-------------------------------------------------------"); printf("\n n-Queen problem using Backtracking"); printf("\n-------------------------------------------------------"); printf("\n Enter number of Queen:"); scanf("%d",&n); Queen(1,n); } void print_board(int n) { int i,j; printf("\n-------------Solution %d---------------\n ",++count); for(i=1;i OUTPUT ------------------------------------------------------- n-Queen problem using Backtracking ------------------------------------------------------- Enter number of Queen:4 -------------Solution 1--------------- 1 2 3 4 ------------------------------------------------------- 1 | - Q - - 2 | - - - Q 3 | Q - - - 4 | - - Q - --...