About Hi I'm Mudau Davis From Johannesburg, South Africa. Coding helped to understand 1's and 0's in a new way that there is more in 1's and 0's than 0 and 1. I spend most of my time coding in C++ and Java as a back end developer. All of my coding projects are done using classes(OOP). I believe in using the skills to change the world for better and learning more and more technologies
Skills
  1. C++
  2. Java
  3. C#
  4. Javascript
  5. asp.net
  6. PhP
  7. Html+Css
  8. MsSql
  9. NodeJs
  10. vueJs
  11. ReactJs
  12. Entity Framework
  13. Firebase cloud functions
  14. NativeScript(Mobile)
  15. ReactNative(Mobile)
  16. MongoDb
Contact you can email me @ mudau.n4@gmail.com or follow me on Social media Platforms.Recent-Project(https://github.com/netshedzo/QRoauth/)
Summary To me Object Orientated Programming together with Machine Learning can be used to do more than what we are using it for, for example we can use it for understanding human behavior and monitoring the changes in humans and the environment,lastly it can be used to detect and prevent sicknesses and disasters. Having the righ amount of data can enable us to tackle more problems in society
Why do you Code?
“I code to solve day to day problems to eliminate the tech gap in my country and making the world a better place in the 4IR ”
where are you from?
“ Currently staying in Johannesburg South Africa ”
Coding interests
“ Artificial Intelligence , Machine Learning and Cyber Security, MicroServices, Mobile ”
Object Orientaited Programing
“ I believe in OOP and I think using it will enable us to open doors in problem solving ”
Code Combating
“ Design making and breaking the code into smaller tasks using OOP and making necessary classes required ”
Education
“ Undergraduate at the University Of Johannesburg ” 
 1
   2
   3
   4
   5
   6
   7
   8
   9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40
  41
  42
  43
  44
  45
  46
  47
  48
  49
  50
  51
 public void DistanceAlgorith2(ArrayList<FactoryClass> ThisList)
  	  {
  		ArrayList<FactoryClass> ElementType = new ArrayList<FactoryClass>();
  		 if(Element != "")
  		  {
  			 for(FactoryClass a : ThisList)
  			 {
  				 if(a.NameTag.toUpperCase() == Element)
  				 {

  					 ElementType.add(a);
  				 }
  			 }
  			     int Index = 0 ;
  			   try
  			   {
  			    int Distance =Math.abs(ElementType.get(0).Xpos - this.Xpos)
  				+ Math.abs(ElementType.get(0).Ypos - this.Ypos) ;
  			    if(Distance  < 0)
  					 Distance = Distance*-1;
  			    System.out.println("I was here");
  			    int LocalDistance = 0;
  			    int LocalIndex =  0;


  			 for(FactoryClass a : ElementType)
  			 {
  				 LocalDistance = Math.abs(a.Xpos - this.Xpos) + Math.abs(a.Ypos - this.Ypos) ;
  				 if(LocalDistance  < 0)
  					 LocalDistance = LocalDistance*-1;
  					if(Distance > LocalDistance)
  					{
  					Distance = LocalDistance;
  					Index = LocalIndex;
  					}
  					LocalIndex++;
  			 }

  			    this.TargetXX =  ElementType.get(Index).Xpos;
  				this.TargetYY = ElementType.get(Index).Ypos;
  				this.OutPut += ElementType.get(Index).Index + "," ;
  				this.ToFactory = true;
  			   }catch(IndexOutOfBoundsException ex)
  			   {

  			   }

  		  }

  	  }

Coding background Experience

“Coded the DistanceAlgorith2 When i was coding a project to Find the shortest distance to move minerals between the factories and mines at the cheapest cost. It finds ways between factories that will cost less ”
“Coded these functions when developing a War-ants game where ants automatically follow other ants if a bug was detected for them to attack in groups. The game used threads and CheckRange was used to find if whether or not the ant was close to a bug ” 
 1
   2
   3
   4
   5
   6
   7
   8
   9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40
  41
  42
  43
  44
  45
  46
  47
  48
  49
  50
  51
  52
  53
  54
  55
  56
  57
  58
  59
  60
  61
  62
  63
  64
  65
  66
  67
  68
  69
  70
  71
  72
  73
  74
  75
  76
  77
  78
  79
  80
  81
  82
  83
  84
  85
  86
  87
  88
  89
  90
  91
  92
public void CheckRange()
  	{
  		if(BugPosX >= PositionX && BugPosY >= PositionY)
  		{
  			if((BugPosX - PositionX)  <= 5 && (BugPosY - PositionY)  <= 5)
  			{
  				CloseBug = true;
  			}

  		}else if((BugPosX >= PositionX && BugPosY < PositionY ))
  		{
  			if((BugPosX - PositionX)  <= 5 || (PositionY - BugPosY)  <= 5)
  			{
  				CloseBug = true;
  			}
  		}else if((BugPosX < PositionX && BugPosY >= PositionY ))
  		{
  			if(( PositionX - BugPosX)  <= 5 && (BugPosY - PositionY)  <= 5)
  			{
  				CloseBug = true;
  			}
  		}else if(BugPosX < PositionX && BugPosY < PositionY)
  		{
  			if(( PositionX - BugPosX)  <= 5 && ( PositionY - BugPosY)  <= 5)
  			{
  				CloseBug = true;
  			}
  		}else
  		{
  			CloseBug = false;
  		}
  	}
      private int CalculateTotal(Ants Ant)
      {
      int Total = 0 ;
      int intX = 0 ;
      int intY = 0;
      if(Ant.getXposition() > this.getXposition())
      {
      	intX =Ant.getXposition()-this.getXposition();
      }else
      {
      intX =this.getXposition()-Ant.getXposition();
      }

      if(Ant.getYposition() > this.getYposition())
      {
      	intY =Ant.getYposition()-this.getYposition();
      }else
      {
      intX = this.getYposition()-Ant.getYposition();
      }
      Total =intX + intY;
      if(Total <= 5) {
      	AntClosest = Ant;
      	Total += 200000; //to avoid setting the wrong target
      }

      	return Total;
      }
  	public void UpdateBugPos(Point A)
  	{
  		BugPosX = A.x;
  		BugPosY = A.y;
  	}

  	public void SetAntTarget(ArrayList<Ants> ant)
  	{
  	Ants AntTest = ant.get(0);
  	int intTotal = CalculateTotal(AntTest);
  	if(ant != null )
  	{
  	for(Ants b : ant)
  	{
  	  if(b != AntClosest && b != this)
  	  {
  		int localTotal = CalculateTotal(b);
  		if(localTotal < intTotal)
  		{
  			AntTest = b;
  			intTotal = localTotal;
  		}
  	  }
  	}
  	if(!FollowAnts)
  	{
  		targetX = AntTest.getXposition();
  		targetY = AntTest.getYposition();
  	}
  	}
  	}
Sorry the Browser screen is not Supported please open with desktop >=1366p :( i.e open with a laptop or pc