module encoder83(o,i);
    output [2:0]o;
    input [7:0]i;
    wire x,y,k,l,m;
    or1 u1(x,i[5],i[4]);
    or1 u2(y,i[7],i[6]);
    or1 u3(o[2],x,y);
    or1 u4(k,i[3],i[2]);
    or1 u5(o[1],y,k);
    or1 u6(l,i[7],i[5]);
    or1 u7(m,i[3],i[1]);
    or1 u8(o[0],l,m);
endmodule

The post Verilog HDL Program for 3-8 ENCODER first appeared on Student Projects.

import java.net.*;
import java.io.*;

public class ip_localmachine
{
	public static void main(String args[]) throws Exception
	{
		InetAddress ipadd =InetAddress.getLocalHost();
		System.out.println("Host and Address :"+ipadd);
		System.out.println("Host name :"+ipadd.getHostName());

		String n=ipadd.toString();
		System.out.println("IP address :"+n.substring(n.indexOf("/")+1));
	}
}

The post Java program to display Local machines IP Address first appeared on Student Projects.

#include
#include
#include
using namespace std;
int shortest(int ,int);
int cost[10][10],dist[20],i,j,n,k,m,S[20],v,totcost,path[20],p;
main()
{
int c;
cout <<"enter no of vertices";
cin >> n;
cout <<"enter no of edges"; 
cin >>m;
cout <<"\nenter\nEDGE Cost\n";
for(k=1;k<=m;k++)
{
cin >> i >> j >>c;
cost[i][j]=c;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(cost[i][j]==0)
cost[i][j]=31999;
cout <<"enter initial vertex";
cin >>v;
cout << v<<"\n";
shortest(v,n);
 }

int shortest(int v,int n)
{
int min;
for(i=1;i<=n;i++)
{
S[i]=0;
dist[i]=cost[v][i];
}
path[++p]=v;
S[v]=1;
dist[v]=0;
for(i=2;i<=n-1;i++)
{
k=-1;
min=31999;
for(j=1;j<=n;j++)
{
if(dist[j]=dist[k]+cost[k][j] && S[j]!=1)
 dist[j]=dist[k]+cost[k][j];
}
}

OUTPUT

enter no of vertices6
enter no of edges11

enter
EDGE Cost
1 2 50
1 3 45
1 4 10
2 3 10
2 4 15
3 5 30
4 1 10
4 5 15
5 2 20
5 3 35
6 5 3
enter initial vertex1
1
14
145
1452
13

The post C++ program to solve the single source shortest path problem Using Dijkstra’s algorithm first appeared on Student Projects.

import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Container;
import java.awt.GridLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;

import javax.swing.JApplet;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JPanel;
import javax.swing.JTextField;

public class PopupCalculatorApplet extends JApplet implements ActionListener {
  public void init() {
    Button calcButton = new Button("Calculator");
    calcButton.addActionListener(this);
    Container contentPane = getContentPane();
    contentPane.add(calcButton);
  }

  public void actionPerformed(ActionEvent evt) {
    if (calc.isVisible())
      calc.setVisible(false);
    else
      calc.show();
  }

  private JFrame calc = new CalculatorFrame();
}

class CalculatorPanel extends JPanel implements ActionListener {
  public CalculatorPanel() {
    setLayout(new BorderLayout());

    display = new JTextField("0");
    display.setEditable(false);
    add(display, "North");

    JPanel p = new JPanel();
    p.setLayout(new GridLayout(4, 4));
    String buttons = "789/456*123-0.=+";
    for (int i = 0; i < buttons.length(); i++)
      addButton(p, buttons.substring(i, i + 1));
    add(p, "Center");
  }

  private void addButton(Container c, String s) {
    JButton b = new JButton(s);
    c.add(b);
    b.addActionListener(this);
  }

  public void actionPerformed(ActionEvent evt) {
    String s = evt.getActionCommand();
    if ('0' <= s.charAt(0) && s.charAt(0) <= '9' || s.equals(".")) {
      if (start)
        display.setText(s);
      else
        display.setText(display.getText() + s);
      start = false;
    } else {
      if (start) {
        if (s.equals("-")) {
          display.setText(s);
          start = false;
        } else
          op = s;
      } else {
        calculate(Double.parseDouble(display.getText()));
        op = s;
        start = true;
      }
    }
  }

  public void calculate(double n) {
    if (op.equals("+"))
      arg += n;
    else if (op.equals("-"))
      arg -= n;
    else if (op.equals("*"))
      arg *= n;
    else if (op.equals("/"))
      arg /= n;
    else if (op.equals("="))
      arg = n;
    display.setText("" + arg);
  }

  private JTextField display;

  private double arg = 0;

  private String op = "=";

  private boolean start = true;
}

class CalculatorFrame extends JFrame {
  public CalculatorFrame() {
    setTitle("Calculator");
    setSize(200, 200);

    Container contentPane = getContentPane();
    contentPane.add(new CalculatorPanel());
  }
}

The post Java Program for calculator first appeared on Student Projects.

import java.util.Scanner;
 class solutions
{
	public static void main(String[] args)
	{
		int a,b,c;
		double x,y;
		Scanner s=new Scanner(System.in);
		System.out.println(“Enter the values of a,b, and c”);
		a=s.nextInt();
		b=s.nextInt();
		c=s.nextInt();
		int k=(b*b)-4*a*c;
		if(k<0)
		{
			System.out.println(“No real roots”);
		}
		else
		{
			double l=Math.sqrt(k);
			x=(-b-l)/2*a;
			y=(-b+l)/2*a;
			System.out.println(“Roots of given equation:”+x+” “+y);
		}
	}
} 

Output:

Enter the values of a,b,c
1
5
6
Roots of given equation:-3.0 -2.0

Enter the values of a, b, c
1
2
2
No real solutions

Enter the values of a, b, c
1
3
2
Roots of given equation: -2.0 -1.0

The post Java program that prints all real solutions to the quadratic equation ax2+bx+c=0 first appeared on Student Projects.

#include
#include
void main()
{
int path[5][5],i,j,min,a[5][5],p,st=1,ed=5,stp,edp,t[5],index;
clrscr();
printf("enter the cost matrix\n");
for(i=1;i<=5;i++)
for(j=1;j<=5;j++)
scanf("%d",&a[i][j]);
printf("enter  number of paths\n");
scanf("%d",&p);
printf("enter possible paths\n");
for(i=1;i<=p;i++)
for(j=1;j<=5;j++)
scanf("%d",&path[i][j]);
for(i=1;i<=p;i++)
{
t[i]=0;
stp=st;
for(j=1;j<=5;j++)
{
edp=path[i][j+1];
t[i]=t[i]+a[stp][edp];
if(edp==ed)
break;
else
stp=edp;
}
}
min=t[st];index=st;
for(i=1;i<=p;i++)
{
if(min>t[i])
{
min=t[i];
index=i;
}
}
printf("minimum cost %d",min);
printf("\n minimum cost path ");
for(i=1;i<=5;i++)
{
printf("--> %d",path[index][i]);
if(path[index][i]==ed)
break;
}
getch();
}

OUTPUT:
enter the cost matrix :
0 1 4 2 0
0 0 0 2 3
0 0 0 3 0
0 0 0 0 5
0 0 0 0 0
enter number of paths : 4
enter possible paths :
1 2 4 5 0
1 2 5 0 0
1 4 5 0 0
1 3 4 5 0
minimum cost : 4
minimum cost path :
1–>2–>5

The post C program to find the Shortest path for a given graph first appeared on Student Projects.