Computer Science Data

Oleksandr Kravchuk

Seattle, WA 206-***-**** ac0wb8@r.postjobfree.com US Citizen

My CMS website: http://ddion.com/webcert_s17/oleksandrk/CMS_final/

My DreamWeaver website: http://ddion.com/webcert_s17/oleksandrk/DreamWeaverFinal/

Summary:

An aspirant with strong practices in software development, object oriented programming and data structure.

Skills:

•Advanced: Java, C#.

•Proficient: HTML, CSS, ASP.NET, SQL, DreamWeaver, Delphi.

•Basic: Python, BASIC

•Spoken languages: English, Russian, and Ukrainian.

Education:

may.2017-jun.2017(now), Lake Washington Institute of Technology, Kirkland WA.

Specialization: Web and Mobile design

Completed Courses:

•HTML and CSS

•Web and Mobile design

•Dreamweaver

•CMS

2016-2017, University of California, San Diego-online courses.

Specialization: Data Structures and Algorithms

Completed Courses:

•Algorithmic Toolbox

•Data Structures

•Algorithms on Graphs

•Algorithms on Strings

•Advanced Algorithms and Complexity

2015-2016, University of California, San Diego .

Specialization: Object Oriented Java Programming: Data Structures and Beyond(link to Certificate).

Projects developed:

•Object Oriented Programming in java (link to Certificate).

•Created mapping application that showed on the map all earth quakes that happened last week, marks on the map varied by magnitudes and depth of the earth quake

•Featured statistics of the earth quakes on the side of the map.

•Data structures: Measuring and Optimizing Performance (link to Certificate).

•Created simple text editor. Where you can type in a text and it will check for spelling suggestions, if it’s misspelled it will show you correct words

•Created a word paths from one word to another word using single character transformation.

•Advanced Data Structures in java (link to Certificate).

•Created program that takes a piece of the map and makes a graph of the piece you selected, where Nodes are the intersections and Edge are streets (name, length, start nodes, end notes).

• Program will find path from start node to end node using either A*, Dijkstra’s Algorithm or BFS.

•Capstone: Analyzing (Social) Network Data (link to Certificate).

•Takes date from social network and creating a graph, where people are vertex and friendships are edges.

•Divides the graph into two most connected graphs.

2003-2007 Diploma with distinction of Bachelor Degree in Computer Science

Projects developed:

•Programming (C#)

•Object orientated programming (C#)

•Data base (SQL)

•Discrete Mathematics

•System programming and operating systems (Assembler)

Contact this candidate