Jydas
BAN USERSince 2006, I have served as a software engineer for the University of Informatics Sciences in La Habana Cuba, where I have been recognized for developing innovative solutions, deployed software and systems. I am responsible for full lifecycle development of next-generation software, from initial requirement gathering to design, coding, testing, documentation and implementation
Jorge De Armas
• 7316 Mitzi Deborah Ln, Charlotte, NC 28269
• Phone number: 980 522 5977
• jorgedearmas86@gmail.com
Professional Summary
• Software Engineer with a few years of experience in the aspects of the software development life cycle. Focused on the design and implementation of applications. Delivering high quality solutions. Highly motivated lead developer, constant and fast learner is always looking for new technologies, tools and solutions to improve his skill set.
Skills
Java Software Engineering
C++ Algorithms
PHP Data Structures
HTML OOP
CSS Eclipse
JavaScript Netbeans
MySQL Mobile Applications
Android PostgreSQL
Work History
• Software Engineer, 09/2011 to 10/2014
• University of Informatics Sciences – La Habana Cuba
• Played developer role in a dependable software development team, working in a Web viewer system for digital medical images that allows the medical images visualization and management of image studies reports.
Education
• Software Engineer: Informatics Sciences, 2011
• University of Informatics Sciences - La Habana Cuba
import java.util.HashMap;
import java.util.Iterator;
import java.util.Set;
public static HashMap managerControl(HashMap elements)
{
HashMap<String,Integer> map=new HashMap<String,Integer>();
Set set=elements.entrySet();
Iterator i=set.iterator();
//Here we create a new map with the direct employees of each manager
while(i.hasNext())
{
Map.Entry me=(Map.Entry)i.next();
String manager=(String)me.getValue();
String employee=(String)me.getKey();
if(employee!=manager)
{
int count=0;
if(!map.containsKey(employee))
map.put(employee, count);
if(!map.containsKey(manager))
map.put(manager, ++count);
else
{
count=map.get(manager);
count++;
map.put(manager, count);
}
}
}
Iterator j=set.iterator();
//Here we add the subordinates of each employee to the manager
while(j.hasNext())
{
Map.Entry me=(Map.Entry)j.next();
String manager=(String)me.getValue();
String employee=(String)me.getKey();
if(employee!=manager)
{
int emp=map.get(employee);
int man=map.get(manager);
int sum=emp+man;
map.put(manager, sum);
}
}
return map;
}
public static int[] reBuildTree(int[] preOrder,int[] inOrder)
{
int count=preOrder.length*2;
int[] tree=new int[count];
int i=0;
buildTree(preOrder, inOrder, tree, i);
return tree;
}
public static void buildTree(int[]preOrder,int[]inOrder,int[]tree,int i)
{
if(preOrder.length>0)
{
int root=preOrder[0];
tree[i]=root;
//assume there are not duplicate elements in the tree
int j=0;
while(inOrder[j]!=root && j<inOrder.length)
j++;
if(j>0)
{
int[] inOrderLeft=new int[j];
int[] preOrderLeft=new int[j];
int z=0;
//All the elements to the left of the root are the left subtree
while(inOrder[z]!=root && z<inOrder.length)
{
inOrderLeft[z]=inOrder[z];
preOrderLeft[z]=preOrder[z+1];
z++;
}
buildTree(preOrderLeft, inOrderLeft, tree, 2*i+1);
}
if(j<inOrder.length)
{
int[] inOrderRight=new int[inOrder.length-(j+1)];
int[] preOrderRight=new int[preOrder.length-(j+1)];
j++;
int k=0;
//All the elements to the right of the root are the right subtree
while(j<inOrder.length)
{
inOrderRight[k]=inOrder[j];
preOrderRight[k]=preOrder[j];
j++;
k++;
}
buildTree(preOrderRight, inOrderRight, tree, 2*i+2);
}
}
return;
}
public static ArrayList<Vector> getTriangleSides(int[]segments)
{
int[]elements=segments;
ArrayList<Vector> triplet=new ArrayList<Vector>();
if(elements.length<3)
return triplet;
else
{
quickSort(0, elements.length-1, elements);
for(int i=0;i<elements.length-2;i++)
{
if(elements[i]+elements[i+1]>elements[i+2])
{
Vector vector=new Vector(3);
vector.add(elements[i]);
vector.add(elements[i+1]);
vector.add(elements[i+2]);
triplet.add(vector);
}
}
return triplet;
}
}
- Jydas June 09, 2015