Viktoriia Roslav
Offer Viktoriia work on your next project.
Private message
Offer work
Kharkiv,
Ukraine
4 months 20 days back
available for hire
on the service 2 years
Rating
Successful projects
Average rating
CV
I'm a game developer on Visual Studio. If you want to order my game with interface, I will be glad to help!
I can also draw characters as well as animations for them in Pixel art.
I can make presentations in PowerPoint.
• I know programming languages such as C++ / C / C# / Python.
• Full project management from start to finish.
• Working with the Pixel art app. I know how to make animations and how to create a character well.
• I can make edits to the work.
• Experience with PowerPoint is available.
• For me it is important to keep in touch with the buyer, so write to telegram and there we will negotiate all the details for your program / animation / character.
My telegram: Vikackaaerx03
Skills and abilities
Portfolio
-
Program in C++
C & C++
Condition: Develop a program that reads input data from the keyboard and solves the problem using dynamic programming or a greedy algorithm.
Solve the problem of selecting the largest number of applications for the audience.
Input data: the number of applications N (1 < N < 256), N pairs of natural numbers - the start and end of applications. Output data: applications sorted in ascending order of end time, and the numbers of applications that need to be selected.
-
Program in C++
C & C++
Condition: Develop a program that reads numbers N, M (1 < N, M < 256) from the keyboard - the number of vertices and edges of the graph; a sequence of M pairs of integers - edges of the graph. The program stores the graph - an adjacency list and performs an algorithm on it - to determine whether the given graph is a tree or a forest.
-
Program in C++
C & C++
Condition: Develop a program that reads numbers N, M (1 < N, M < 256) from the keyboard; a sequence of N keys (integers); a sequence of M keys. The program stores the first sequence in a red-black tree. Each time a new element is added to the tree, it is necessary to output statistics according to the maximum element and its color. After building the tree, for each element x of the second sequence, it is necessary to output the results of the following operations on the tree - whether the element is in the tree and its color.
-
Program in C++
C & C++
Task: Develop a program that reads integers N, M (1 < N, M < 256) from the keyboard, N pairs (key - integer, real number, or string depending on the task variant; value - string; all strings up to 255 characters), none of which are repeated, and M more keys. All strings are separated by a space or a new line. The program stores pairs of strings in a hash table and outputs the values corresponding to the listed keys on the screen. It is mandatory to implement one of the collision resolution methods. Task variant - key is a string; Pearson hashing.
Example input for string keys:
… 3 2
abc x
gh yq
io qw
gh
io
Output:
yq
qw
Using ready-made data structure implementations (e.g., STL) is prohibited, but you can use string implementation (e.g., std::string in C++).
-
Program in C++
C & C++
Task: Develop a program that reads a sequence of N integers (1 < N < 256) from the keyboard, each of which is unique, stores them in a data structure queue (based on a linked list), and displays the following characteristics on the screen:
- number of elements;
… - average of the stored elements;
- minimum and maximum element;
- the fourth element of the sequence;
- the element that comes before the minimum element.
It is important to note that all characteristics need to be determined from the filled data structure. Only operations inherent to the specified structure are allowed, for example, accessing an element at any position in the queue is prohibited.
Using ready-made implementations of data structures (e.g., STL) is prohibited.
-
Program in C++
C & C++
Condition: Develop a program that reads from the keyboard the number N (1 < N < 256) and N pairs of real numbers - coordinates of points on the plane. Build the convex hull of the given points using the Jarvis algorithm.
-
Program in C++
C & C++
Condition: Develop a program that reads a number N (1 < N < 256) from the keyboard and the parameters of a random number generator using the Fibonacci method, and displays on the screen a sequence of N generated numbers. The program saves a graphical representation of the distribution sequence on the plane to a file (elements are processed pairwise as coordinates of points (x, y)) and displays the result of a frequency bitwise test on the screen.
-
Program in C++
C & C++
Task: Develop a program that reads numbers N, M (1 < N, M < 256) from the keyboard; a sequence of N keys (integers or real numbers depending on the task variant); a sequence of M keys. The program saves the first sequence to an array and performs sorting by exception. Then the program displays the sorted sequence on the screen and performs a binary search for each element of the second sequence. For each element of sequence M, report whether it is in the first sequence, and if so, at which position it is located.
-
Program in C++
C & C++
Condition: Create a class Payment. Fields: full name, salary, year of employment, income tax, bonus percentage, number of days worked per month, accrued and withheld amounts. Implement methods: calculation of the accrued amount, calculation of the withheld amount, amount to be paid out, calculation of seniority. In addition to the specified operations, the following methods must be implemented: initialization method Init, input from the keyboard Read, display on the screen Display, conversion to a string toString. All fields are private.
-
Pixel art background part 2
Continuation of the background
-
Pixel art background part 1
Background for a game or desktop. Continuation of the background in the second part.
-
Pixel art animation
Animation of a bird in Pixel art
-
Pixel art animation
Animation
Animation of a coin in Pixel art
-
Pixel art animation
Animation
Character animation in Pixel art
-
Pixel characters
Icons & Pixel Graphics
They were created for play
