{"id":21170122,"url":"https://github.com/novikovadaria/geekbrains_java","last_synced_at":"2026-06-09T16:01:34.343Z","repository":{"id":153471867,"uuid":"574994350","full_name":"novikovadaria/GeekBrains_Java","owner":"novikovadaria","description":"Домашняя работы по java. GeekBrains University. Программирование | Java homework. GeekBrains University. Programming","archived":false,"fork":false,"pushed_at":"2023-06-30T13:14:16.000Z","size":33,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-14T17:27:27.214Z","etag":null,"topics":["geekbrains","homework","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/novikovadaria.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-12-06T14:22:34.000Z","updated_at":"2024-01-12T18:52:05.000Z","dependencies_parsed_at":"2025-01-21T10:42:54.726Z","dependency_job_id":"3902ea4f-ebe8-483a-b8a7-2729d8e6bb1d","html_url":"https://github.com/novikovadaria/GeekBrains_Java","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/novikovadaria/GeekBrains_Java","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/novikovadaria%2FGeekBrains_Java","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/novikovadaria%2FGeekBrains_Java/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/novikovadaria%2FGeekBrains_Java/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/novikovadaria%2FGeekBrains_Java/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/novikovadaria","download_url":"https://codeload.github.com/novikovadaria/GeekBrains_Java/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/novikovadaria%2FGeekBrains_Java/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34114437,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-09T02:00:06.510Z","response_time":63,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["geekbrains","homework","java"],"created_at":"2024-11-20T15:56:34.716Z","updated_at":"2026-06-09T16:01:34.293Z","avatar_url":"https://github.com/novikovadaria.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Tasks\n## Lesson 1. Introduction to the Java programming language\nImplement a function to raise the number a to the power of b. a, b ∈ Z. By reducing the number of actions performed to a minimum.\n\nExample 1: a = 3, b = 2, answer: 9\n\nThe result should be saved in the file output.txt\n\n## Lesson 2. Why You Can't Not Use APIs\nGiven a sequence of N integers. Find the number of positive numbers followed by a negative number.\n\nGiven a sequence of integers ending with zero. Find the sum of positive numbers followed by a negative number.\n\nGiven a sequence of N integers. Find the sum of prime numbers.\n\nOOP:\n\nWrite a Converter interface for converting from degrees Celsius to Kelvin, Fahrenheit. The subclasses need to override the interface method for a valid conversion of values. Name the conversion method \"convertValue\".\n## Lesson 3. JAVA Collections: Introduction\nGiven an array of records: product name, price, grade. Find the highest price of 1st or 2nd grade goods among goods whose name contains \"highest\".\n\nProduct information consists of name, country of manufacture, weight, price, grade. Get the names of the products of the given grade with the lowest price.\n\n## Lesson 4. Data storage and processing part 1: priority collections\nPrint the list in reverse order (without arrays)\nExample: 1 -\u003e 2-\u003e3-\u003e4 Output: 4-\u003e3-\u003e2-\u003e1\n\nDetermine if the list is alternating in sign? (without arrays)\n# Задания\n## Урок 1. Знакомство с языком программирования Java\nРеализовать функцию возведения числа а в степень b. a, b ∈ Z. Сводя количество выполняемых действий к минимуму.\n\nПример 1: а = 3, b = 2, ответ: 9\n\nРезультат нужно сохранить в файле output.txt\n\n## Урок 2. Почему вы не можете не использовать API\n1) Дана последовательность N целых чисел. Найти количество положительных чисел, после которых следует отрицательное число.\n\n2) Дана последовательность целых чисел, оканчивающаяся нулем. Найти сумму положительных чисел, после которых следует отрицательное число.\n\n3) Дана последовательность N целых чисел. Найти сумму простых чисел.\n\nООП:\n\n1)Напишите интерфейс Converter для конвертации из градусов по Цельсию в\nКельвины, Фаренгейты. У классов наследников необходимо переопределить метод интерфейса, для валидного перевода величин. Метод для конвертации назовите \"convertValue\".\n## Урок 3. Коллекции JAVA: Введение\n1. Дан массив записей: наименование товара, цена, сорт. Найти наибольшую цену товаров 1го или 2го сорта среди товаров, название которых содержит «высший».\n\n2. Сведения о товаре состоят из наименования, страны-производителя, веса, цены, сорта. Получить наименования товаров заданного сорта с наименьшей ценой.\n\n## Урок 4. Хранение и обработка данных ч1: приоритетные коллекции\n\n1) Вывести список на экран в перевернутом виде (без массивов)\n\nПример:\n1 -\u003e 2-\u003e3-\u003e4\nВывод:\n4-\u003e3-\u003e2-\u003e1\n\n2) Определить является ли список знакочередующимся? (без массивов)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnovikovadaria%2Fgeekbrains_java","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnovikovadaria%2Fgeekbrains_java","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnovikovadaria%2Fgeekbrains_java/lists"}