yaswanthrajyadiki

Relication of data base from external MySql Instance to Amazon RDS Instance

Links:
  Replication with a MySQL or MariaDB Instance Running External to Amazon RDS
    https://docs.aws.amazon.com/AmazonRDS/latest/UserGuide/MySQL.Procedural.Importing.External.Repl.html
  Importing Data to an Amazon RDS MySQL or MariaDB DB Instance with Reduced Downtime
    https://docs.aws.amazon.com/AmazonRDS/latest/UserGuide/MySQL.Procedural.Importing.NonRDSRepl.html

yaswanthrajyadiki

import java.util.Random;
import java.util.PriorityQueue;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.Scanner;
import java.util.ArrayList;
@SuppressWarnings("unchecked")

class MyHashTable {

yaswanthrajyadiki

import java.util.Scanner;
import java.util.StringTokenizer;

class BredthFirstSearch {
	boolean[] visited;
	Queue<Integer> vertexQueue;
	int[][] array;
	int size;

	BredthFirstSearch(int size) {

yaswanthrajyadiki

import java.util.Scanner;
import java.util.StringTokenizer;

class FindingEdgesInGraph {
	int[][] array;
	int size;
	int edgesCount;
	FindingEdgesInGraph (int size) {
		this.size = size;
		array = new int[size][size];

yaswanthrajyadiki

import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.ArrayList;
@SuppressWarnings("unchecked")

class BinarySearchTree<T extends Comparable<T>> {
	
	Node<T> rootNode;
	int index = 0;
	int level = 0;

yaswanthrajyadiki

import java.util.ArrayList;
import java.util.Scanner;
import java.util.StringTokenizer;
class BinaryTreeHeight<T extends Comparable<T>> {
	Node<T> rootNode;
	int index = 0;
	int level = 0;
	int nodePointer = 0;
	Node<T> childNode;
	Node<T> traverseNode;

yaswanthrajyadiki

import java.util.ArrayList;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.Queue;
import java.util.LinkedList;

class BinaryTrees<T extends Comparable<T>> {
	Node<T> rootNode;
	int index = 0;
	int level = 0;

yaswanthrajyadiki

import java.util.ArrayList;
@SuppressWarnings("unchecked")

class BinaryTree<T extends Comparable<T>> {
	
	Node<T> rootNode;
	int index = 0;
	int level = 0;
	int nodePointer = 0;
	Node<T> childNode;

yaswanthrajyadiki

import java.util.ArrayList;
@SuppressWarnings("unchecked")
class BinaryHeap<T extends Comparable<T>> implements BinaryHeapADT<T> {

	int size;
	T[] heapArray;
	int heapSize;
	BinaryHeap (int size) {
		this.size = size;
		heapArray = (T[]) new Comparable[size];

yaswanthrajyadiki

class LinkedListStack<T> {
	Node<T> bottom;
	Node<T> top;
	MyStack() {
		bottom = new Node<T>();
		top = new Node<T>();
	}
	
	public void push(T element) {
		Node<T> newNode = new Node<T>();