Data structure | Student Projects

How to return Nth the node from the end of the linked list in one pass

Chitra — Tue, 12 Apr 2022 14:07:44 +0000

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.

How to print a data from a binary tree in-order(ascending)

Chitra — Tue, 12 Apr 2022 13:47:37 +0000

//
// 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.

How to insert a node into a sorted linked list

Chitra — Tue, 12 Apr 2022 05:15:41 +0000

void sortedInsert(Node * head, Node * newNode) {
  Node * current = head;

  // traverse the list until you find item bigger the // new node value
  //	
  while (current != NULL && current -> data < newNode -> data) {
    current = current -> next);
}
//
// insert the new node before the big item
//
newNode -> next = current -> next;
current = newNode;
}

The post How to insert a node into a sorted linked list first appeared on Student Projects.

How to sort a linked list

Chitra — Tue, 12 Apr 2022 05:02:36 +0000

//sorting in descending order
struct node {
  int value;
  node * NEXT;
}
//Assume HEAD pointer denotes the first element in the //linked list
// only change the values…don’t have to change the //pointers

Sort(Node * Head) {
  node * first, second, temp;
  first = Head;
  while (first != null) {
    second = first -> NEXT;
    while (second != null) {
      if (first -> value < second -> value) {
        temp = new node();
        temp -> value = first -> value;
        first -> value = second -> value;
        second -> value = temp -> value;
        delete temp;
      }
      second = second -> NEXT;
    }

    first = first -> NEXT;
  }
}

The post How to sort a linked list first appeared on Student Projects.

How to delete a node in a double linked list

Chitra — Tue, 12 Apr 2022 04:59:19 +0000

void deleteNode(node *n)
{
node *np = n->prev;
node *nn = n->next;
np->next = n->next;
nn->prev = n->prev;
delete n;
}

The post How to delete a node in a double linked list first appeared on Student Projects.

How to reverse a singly linked list

Chitra — Tue, 12 Apr 2022 04:58:11 +0000

//
// iterative version
//
Node* ReverseList( Node ** List )	
{

	Node *temp1 = *List;
	Node * temp2 = NULL;
	Node * temp3 = NULL;

	while ( temp1 )
	{
		*List = temp1; //set the head to last node		
temp2= temp1->pNext; // save the next ptr in temp2
		temp1->pNext = temp3; // change next to privous
		temp3 = temp1;
		temp1 = temp2;
	}
 
	return *List;
}

The post How to reverse a singly linked list first appeared on Student Projects.

Program to solve travelling sales person problem using dynamic programming

Chitra — Fri, 08 Apr 2022 04:23:45 +0000

// program to solve travelling sales person problem using dynamic programming

#include 
#include

#define MAX 100
#define INFINITY 999

class travel
{
	private:
		int n; /* Number of cities. */
		int i, j; /* Loop counters. */
		int c[MAX][MAX]; /* Cost matrix. */
		int tour[MAX]; /* Tour matrix. */
		int cost; /* Least cost. */
		int tsp_dp (int c[][MAX], int tour[], int start, int n);

	public:
		int tsp();
		void setdata();
		void getdata();
};

int travel::tsp()
{
	return(tsp_dp(c,tour,0,n));
}

void travel::setdata()
{
	cout<<"\nHow many cities to traverse? ";
	cin>>n;

	cout<<"\nEnter the cost matrix: (999: no connection)\n";
	for(i=0;i>c[i][j];
	}

	for(i=0;i

The post Program to solve travelling sales person problem using dynamic programming first appeared on Student Projects.



Program to solve optimal binary search tree problem with dynamic programming
Chitra — Fri, 08 Apr 2022 04:22:46 +0000
// program to solve optimal binary search tree problem with dynamic programming

#include
#include

struct node
{
	int data;
	struct node *left,*right;
};

typedef struct node node;

class binary
{
	private:
		int w[10][10],c[10][10],r[10][10],n;
		int p[10],q[11];

		int find(int,int);
		node *cnst_tree(int,int);

	public:
		void obst();
		void setdata();
		node *tree();
};

node *binary::tree()
{
	return(cnst_tree(0,n));
}

void binary :: setdata()
{
	int i,j;

	cout<<"\nEnter number of identifiers: ";
	cin>>n;

	cout<<"\nEnter values for P vector ("<>p[i];

	cout<<"\nEnter values for Q vector ("<>q[i];
}

void binary :: obst()
{
	int i,j,k,m;

	for(i=0;i<=n-1;i++)
	{
		w[i][i]=q[i];
		r[i][i]=0;
		c[i][i]=0;

		w[i][i+1]=p[i+1]+q[i+1]+q[i];
		r[i][i+1]=i+1;
		c[i][i+1]=w[i][i+1];
	}

	w[n][n]=q[n];
	r[n][n]=0;
	c[n][n]=0;

	for(m=2;m<=n;m++)
		for(i=0;i<=n-m;i++)
		{
			j=i+m;
			w[i][j]=w[i][j-1]+p[j]+q[j];
			k=find(i,j);
			c[i][j]=w[i][j]+c[i][k-1]+c[k][j];
			r[i][j]=k;
		}
}

int binary ::find(int i,int j)
{
	int min=32767,m,l;

	m=r[i][j-1];
	while(m<=r[i+1][j])
	{
		if(c[i][m-1]+c[m][j]data=k;
		p->left=cnst_tree(i,k-1);
		p->right=cnst_tree(k,j);
		return p;
	}
}

void inorder (node *x)
{
	if(x)
	{
		inorder(x->left);
		cout<data<<"\t";
		inorder(x->right);
	}
}

void main()
{
	node *root;
	binary b;
	clrscr();

	b.setdata();

	b.obst();

	root=b.tree();

	cout<<"\nTree in inorder traversal is: \n\n\t";
	inorder(root);

	getch();
}


The post Program to solve optimal binary search tree problem with dynamic programming first appeared on Student Projects.


Program to solve knapsack problem using backtracking problem
Chitra — Fri, 08 Apr 2022 04:22:06 +0000
// program to solve knapsack problem using backtracking problem

#include
#include

class knapsack
{
	private:
		int p[20],w[20],m,x[20],y[20],n;
		int Bound(int,int,int);
		int fp,fw;

	public:
		knapsack()
		{
			fp=0;
		}
		void BKnap(int,int,int);
		void setdata();
		void getdata();
};

void knapsack::setdata()
{
	int i;

	cout<<"\nEnter number of elements: ";
	cin>>n;

	cout<<"\nEnter elements in the descending order of P/W\n";

	for(i=1;i<=n;i++)
	{
		cout<<"\nEnter profit of "<>p[i];
		cout<<"\nEnter weight of "<>w[i];
	}

	cout<<"\nEnter capcity of kanpsack: ";
	cin>>m;
}

int knapsack::Bound(int cp,int cw,int k)
{
	int b,c,i;

	b=cp;
	c=cw;

	for(i=k+1;i<=n;i++)
	{
		c=c+w[i];
		if(cfp) && (k==n))
		{
			fp=cp+p[k];
			fw=cw+w[k];
			for(j=1;j<=k;j++)
				x[j]=y[j];
		}
	}

	if(Bound(cp,cw,k)>=fp)
	{
		y[k]=0;
		if(kfp) && (k==n))
		{
			fp=cp;
			fw=cw;
			for(j=1;j<=k;j++)
				x[j]=y[j];
		}
	}
}

void knapsack::getdata()
{
	int i;

	for(i=1;i<=n;i++)
		cout<<"x["<
The post Program to solve knapsack problem using backtracking problem first appeared on Student Projects.



Program to solve all pairs shortest path problem using dynamic programming
Chitra — Fri, 08 Apr 2022 04:21:22 +0000
// program to solve all pairs shortest path problem using dynamic programming

#include
#include

class graph
{
	int cost[20][20],n,a[20][20];

	public:
		void setdata();
		void getdata();
		void path();
};

void graph::setdata()
{
	int i,j,k;

	cout<<"\nEnter number of nodes: ";
	cin>>n;

	cout<<"\nEnter Cost matrix (32767 for infinity): ";

	for(i=1;i<=n;i++)
	{
		cout<<"\nEnter "<>cost[i][j];
	}
}

void graph::getdata()
{
	int i,j;

	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			cout<l)?l:a[i][j];
			}
}

void main()
{
	graph g;
	clrscr();

	g.setdata();
	g.path();

	cout<<"\nMatrix with Shortest paths is: \n\n";
	g.getdata();

	getch();
}
The post Program to solve all pairs shortest path problem using dynamic programming first appeared on Student Projects.