{"id":21009393,"url":"https://github.com/ronak-goyal-code/c2c-assignment-1","last_synced_at":"2026-02-07T18:04:26.705Z","repository":{"id":259855133,"uuid":"879552917","full_name":"ronak-goyal-code/C2C-Assignment-1","owner":"ronak-goyal-code","description":null,"archived":false,"fork":false,"pushed_at":"2024-10-28T10:27:36.000Z","size":191,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-05T06:38:03.163Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/ronak-goyal-code.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":"2024-10-28T05:55:56.000Z","updated_at":"2025-01-23T14:31:57.000Z","dependencies_parsed_at":"2024-10-28T12:45:38.072Z","dependency_job_id":"9acd0405-2498-4439-98ca-034679f42d6c","html_url":"https://github.com/ronak-goyal-code/C2C-Assignment-1","commit_stats":null,"previous_names":["ronak-goyal-code/c2c-assignment-1"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ronak-goyal-code/C2C-Assignment-1","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ronak-goyal-code%2FC2C-Assignment-1","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ronak-goyal-code%2FC2C-Assignment-1/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ronak-goyal-code%2FC2C-Assignment-1/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ronak-goyal-code%2FC2C-Assignment-1/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ronak-goyal-code","download_url":"https://codeload.github.com/ronak-goyal-code/C2C-Assignment-1/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ronak-goyal-code%2FC2C-Assignment-1/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266640830,"owners_count":23960809,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-23T02:00:09.312Z","response_time":66,"last_error":null,"robots_txt_status":null,"robots_txt_updated_at":null,"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":[],"created_at":"2024-11-19T09:16:35.469Z","updated_at":"2026-02-07T18:04:21.957Z","avatar_url":"https://github.com/ronak-goyal-code.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Assignment Problems\n\n1. Take a float number as input and print the fractional part of the real number.\n\n2. Write a program to find the difference between ASCII values of two characters, taken as input.\n\n3. Take 3 positive integers as input and print the greatest of them.\n\n4. Take a positive integer input and check if it is divisible by 5 or 3 but not divisible by 15.\n\n5. Take 3 numbers as input and determine if they can be the sides of a triangle.\n\n6. Display the arithmetic progression (AP): 100, 97, 94, ... until all terms are positive.\n\n7. Display the geometric progression (GP): 1, 2, 4, 8, 16, 32, ... up to _n_ terms.\n\n8. Create a calculator that performs basic arithmetic operations (add, subtract, multiply, divide) using a switch case and functions. The calculator should input two numbers and an operator from the user.\n\n9. Input any year from the keyboard. Write a program to determine whether the year is a leap year or not.\n\n10. Write a C++ program to input any character and check whether it is an alphabet, digit, or special character.\n\n11. Write a program to check if a number is prime.\n\n12. Write a program to count the digits of a given number.\n\n13. Write a program to print the reverse of a given number.\n\n14. Print the sum of the series: 1 - 2 + 3 - 4 + 5 - 6 + ... up to _n_ terms.\n\n15. Print the factorials of the first _n_ numbers. Take _n_ as input.\n\n16. Print the _n_ th Fibonacci number.\n\n17. Write a program to print the sum of a given number and its reverse.\n\n18. Write a program to print all Armstrong numbers between 1 and 500. An Armstrong number is one for which the sum of the cubes of each digit equals the number itself (e.g., 153 = \\(1^3 + 5^3 + 3^3\\)).\n\n## Patterns\n\n19. Print the pattern (input _n_ = 4):\n    ```\n    A B C D\n    A B C D\n    A B C D\n    A B C D\n    ```\n\n20. Print the pattern (input _n_ = 4):\n    ```\n    1\n    1 3\n    1 3 5\n    1 3 5 7\n    ```\n\n21. Print the pattern (input _n_ = 4):\n    ```\n    1\n    0 1\n    1 0 1\n    0 1 0 1\n    ```\n\n22. Print the pattern (input _n_ = 4):\n    ```\n        ****\n       ****\n      ****\n     ****\n    ```\n\n23. Print the pattern (input _n_ = 4):\n    ```\n            1\n          1 2 1\n        1 2 3 2 1\n      1 2 3 4 3 2 1\n    ```\n\n24. Print the pattern (input _n_ = 4):\n    ```\n            A\n          B A B\n        C B A B C\n      D C B A B C D\n    ```\n\n25. Print the pattern (input _n_ = 4):\n    ```\n          *\n        * * *\n      * * * * *\n    * * * * * * *\n      * * * * *\n        * * *\n          *\n    ```\n\n26. Print the pattern (input _n_ = 4):\n    ```\n    * * * * * * *\n    * * *   * * *\n    * *       * *\n    *           *\n    ```\n\n27. Print the pattern (input _n_ = 4):\n    ```\n    1 2 3 4 5 6 7\n    1 2 3   5 6 7\n    1 2       6 7\n    1           7\n    ```\n\n28. Print the pattern (input _n_ = 4):\n    ```\n    A B C D C B A\n    A B C   C B A\n    A B       B A\n    A           A\n    ```\n\n29. Print the pattern (input _n_ = 5):\n    ```\n              *\n            * * *\n          *   *   *\n        *     *     *\n      *       *       *\n    * * * * * * * * * * *\n      *       *       *\n        *     *     *\n          *   *   *\n            * * *\n              *\n    ```\n\n30. Print the pattern (input _n_ = 4):\n    ```\n    *             *\n    * *         * *\n    * * *     * * *\n    * * * * * * * *\n    * * * * * * * *\n    * * *     * * *\n    * *         * *\n    *             *\n    ```\n\n31. Print the pattern (input _n_ = 4):\n    ```\n    * * * * * * *\n    * * *   * * *\n    * *       * *\n    *           *\n    * *       * *\n    * * *   * * *\n    * * * * * * *\n    ```\n\n32. Print the pattern (input _n_ = 4):\n    ```\n    4 4 4 4 4 4 4\n    4 3 3 3 3 3 4\n    4 3 2 2 2 3 4\n    4 3 2 1 2 3 4\n    4 3 2 2 2 3 4\n    4 3 3 3 3 3 4\n    4 4 4 4 4 4 4\n    ```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fronak-goyal-code%2Fc2c-assignment-1","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fronak-goyal-code%2Fc2c-assignment-1","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fronak-goyal-code%2Fc2c-assignment-1/lists"}