epam_xt_net_web

Repository for Epam External Training Tasks

Task 1.1. The Magnificent Ten

• 1.1.1. Rectangle. Calculate the area of a rectangle with sides A and B.
• 1.1.2. Triangle. Display an image of a rectangular triangle with a height of N lines.
• 1.1.3. Another triangle. Display an image of an isosceles triangle with a height of N lines.
• 1.1.4. X-mas tree. Display an image of a Christmas tree consisting of N isosceles triangles.
• 1.1.5. Sum of numbers. Calculate the sum of all natural numbers from 1 to 1000, which are multiples of 3 or 5.
• 1.1.6. Font adjustment. Write a program to store text formatting options (bold, italic, underline and their combinations).
• 1.1.7. Array processing. Write a program that generates a random array, sorts this array and displays the maximum and minimum elements.
• 1.1.8. No positive. Write a program that replaces all positive elements in a three-dimensional array with zeros.
• 1.1.9. Non-negative sum. Write a program that determines the sum of non-negative elements in a one-dimensional array.
• 1.1.10. 2d array. Determine the sum of all elements of a two-dimensional array that are in even positions.

Task 1.2. String, Not Sting

• 1.2.1. Averages. Write a program that determines the average word length in the entered text string.
• 1.2.2. Doubler. Write a program that doubles in the first input string all the characters that belong to the second input string.
• 1.2.3. Lowercase. Write a program that counts the number of words starting with a lowercase letter.
• 1.2.4. Validator. Write a program that replaces the first letter of the first word in a sentence with a capital letter.

Task 2.1. OOP

• 2.1.1. Custom String. Write your own class that describes the string as an array of characters.
• 2.1.2. Custom Paint. Describe the classes of geometric shapes. Implement your own editor that interacts with rings, circles, rectangles, squares, triangles and lines.

Task 2.2. Game Development

• 2.2.1. Game. Create a class hierarchy and define methods for a computer game. Try making a playable version of your project.

Task 3.1. Weakest Text

• 3.1.1. Weakest Link. There are N people in the circle, numbered from 1 to N. Every second person is crossed out in each round until there is one left. Create a program that simulates this process.
• 3.1.2. Text Analysis. For each word in a given text, indicate how many times it occurs.

Task 3.2. Dynamic Array

• 3.2.1. Dynamic Array. Based on the array, implement your own DynamicArray generic class, which is an array with a margin that stores objects of random types.

Task 3.3. Pizza Time

• 3.3.1. Super Array. Extend the array of numbers with a method that performs actions with each specific element. The action must be passed to the method using a Delegate.
• 3.3.2. Super String. Extend the String with a method that checks what language the word is written in the given string.
• 3.3.3. Pizza Time. Simulate the work of a pizzeria in your application. The user and the pizzeria interact through the pizza order. The user places an order and waits for a notification that the pizza is ready. The peculiarity of your pizzeria is that you do not store customer data.

Task 4.1. Files

• 4.1.1. File Management System. There is a folder with files. For all text files located in this folder or subfolders, save the history of changes with the ability to roll back the state to any moment.

Task 5.1. JavaScript Basics

• 5.1.1. Char Remover. Write a function that receives a string consisting of several words. Words are separated by whitespace and punctuation marks. The function should return a string in which all characters that repeat at least in one of the words more than once will be removed.
• 5.1.2. Math Calculator. Write a function to calculate the result of an arithmetic expression. Input is a string with an expression, output is a calculated value. The result of the expression is evaluated sequentially. Operations are not prioritized. Output the result with precision up to 2 decimal places.
• 5.1.3. Mini Crud. Create a library to store data in application memory.

Task 6.1. Web Basics

• 6.1.1. List Menu. Make up a menu using the ul and li tags. Width the menu should be fixed at 200px.
• 6.1.2. Registration Form. Make up a registration form. The width of the form and its margins must be fixed.
• 6.1.3. Pointing Block. Make up a page. The block width changes depending on the size of the browser window. The pointer is always located in the middle of the block, the size of the pointer is fixed.
• 6.1.4. Three Column Block. Make up the page with three columns. The block width is fixed. Alignment is centered.
• 6.1.5. G-keep. Create a simplified version of google keep. To work with notes, use some of the methods of the library that you created in task 5.1.3. My G-keep: Redone

Task 7.1. Three-Layer

• 7.1.1. Users and Awards. Implement business logic that allows you to work with a list of users: create, delete, and get their list. Use a three-layer architecture as a template. Records must be saved to hard disk in any format, for example, JSON.
• 7.1.2. UI. Add a visual interface based on ASP.NET Web Pages to the created business logic. The application should be able to perform all the same actions as the console version.
• 7.1.3. CRUD. Extend the functionality of the application to CRUD-complete: create, read, update and delete the entities of the list.
• 7.1.4. Images. Implement the ability to add images to users and awards, uploaded by the user himself.

Task 7.2. Role-Playing Game

• 7.2.1. Roles. Add a role model to the application. Provide a login window and a new user registration form. The user can be anonymous, registered or administrator.
• 7.2.2. Database. Implement a Microsoft SQL Server database to store application data. The database must be converted to third normal form.

Final project

Система построения структурных доказательств в натуральном исчислении высказываний