Immanuel Tesfaye

Fourth year Computer Science Pre-Major at Western Washington University with experience with common software applications and social media platforms. Well-versed in business organization and strategies for successfully modernizing workplaces. Skilled at project support with proven history of solutions-oriented problem-solving. Looking forward to bringing skills into a real work setting.

Sorting Algorithms:  

• Using Java, worked with sorting arrays using four different sorting algorithms.
• Implemented many variables, functions, and data structures, such as recursion.

Binary Search Tree into AVL Tree:

• Worked on converting a Binary Search Tree into An AVL Tree.
• All done using recursion, which rotated each node to balance the tree.
• The AVL Tree is then used to find the number of unique lines in a few given text files.

Creating a Heap with a Hash Table: 

• Made a Heap, using many helper methods to make the structure work.
• Then created a Hash Table with chaining, to deal with collision resolution so that values would get rehashed.

 Dijkstra’s Algorithm:

• Implemented Dijkstra’s algorithm, which takes a node of origin, and finds the shortest path to any given node in a tree. Used the heap file that was developed in the previous project.
• Small text files were given to test the shortestPaths method. Then created testing methods, to see if the method would properly do Dijkstra’s algorithm.

• CSCI 241: Data Structures & Algorithms (Java)
• CSCI 301: Functional Proofs(Racket)
• CS& 141: Introduction to Java
• CS 121: Introduction to Python