Sriram digi0ps

Age Group	No. of Loans	Bad Loans	Good Loans	Bad Rate
21-24	310	14	296	4.5
24-27	511	20	491	3.9
27-30	4000	172	3828	4.3
30-33	4568	169	4399	3.7
33-36	5698	188	5510	3.3
36-39	8209	197	8012	2.4
39-42	8117	211	7906	2.6
42-45	9000	216	8784	2.4
45-48	7600	152	7448	2

Boruvka's Algorithm

Boruvka's Algorithm is a minimum spanning tree algorithm.

What's a spanning tree? In a graph (all this is about graphs), the path which covers all the nodes is called the spanning tree. Why tree? Because if a graph contains n nodes, a spanning tree contains n-1 nodes which is a property of a tree.

What's a minimum spanning tree?

Team 40

**Team members: **

Sriram R 16BCE1026
Vishnu Dut 16BCE1103
Jeremy Philemon 16BCE1367

	<html class=""><head>
	<meta http-equiv="X-UA-Compatible" content="IE=Edge">


	<meta charset="utf-8">
	<title>sanjay-stock-game</title>
	<meta name="fb_admins_meta_tag" content="">
	<link rel="shortcut icon" href="https://www.wix.com/favicon.ico" type="image/x-icon">
	<link rel="apple-touch-icon" href="https://www.wix.com/favicon.ico" type="image/x-icon">
	<script type="text/javascript">

	#include <iostream>
	using namespace std;
	int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30 ,31};

	class UDdate
	{
	int day;
	int month;
	int year;
	public:

	/*
	-----------------------------
	Paste into skillrack shortcut.
	-----------------------------
	Open console in your browser by pressing Ctrl+Shift+J in Chrome Windows.
	Or right click the webpage, select inspect element and then change to console tab.
	Paste the code you want into the quotes given in variable CODE and then paste the entire thing into
	the console. And then press enter.

	BUGS rn:

	#include <stdio.h>
	#include <string.h>

	void calc_freq(char* str){
	int freq[255], i, j, temp;
	for(i=0;i<255;i++)
	freq[i] = 0;

	for(i=0;str[i]!='\0';str++){
	int ascii = (int)str[i];

	Library ieee;
	Use ieee.std_logic_1164.all;
	Use ieee.std_logic_unsigned.all;
	Use ieee.std_logic_arith.all;

	entity stm_st1 is
	port (clk:in std_logic; rst:in std_logic;
	out_stm:out std_logic_vector(3 downto 0));
	end stm_st1;
	architecture stm_st_b of stm_st1 is