{"id":17817603,"url":"https://github.com/codelixir/assembly-x86-64","last_synced_at":"2025-04-02T09:13:45.681Z","repository":{"id":233798068,"uuid":"364984292","full_name":"codelixir/assembly-x86-64","owner":"codelixir","description":"Trying out writing arithmetic, conditional, looping components, procedure calls, conditional jumps and stacks in x86-64. For CSO course, Spring 2021.","archived":false,"fork":false,"pushed_at":"2021-05-06T17:29:59.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-08T00:19:08.972Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Assembly","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/codelixir.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":"2021-05-06T17:14:52.000Z","updated_at":"2021-05-06T17:30:01.000Z","dependencies_parsed_at":null,"dependency_job_id":"e0b06f4d-a8d2-4a21-8c07-c05df9b477ed","html_url":"https://github.com/codelixir/assembly-x86-64","commit_stats":null,"previous_names":["codelixir/assembly-x86-64"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codelixir%2Fassembly-x86-64","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codelixir%2Fassembly-x86-64/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codelixir%2Fassembly-x86-64/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codelixir%2Fassembly-x86-64/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codelixir","download_url":"https://codeload.github.com/codelixir/assembly-x86-64/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246785453,"owners_count":20833494,"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","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-10-27T16:44:32.577Z","updated_at":"2025-04-02T09:13:45.656Z","avatar_url":"https://github.com/codelixir.png","language":"Assembly","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![forthebadge](https://forthebadge.com/images/badges/0-percent-optimized.svg)](https://forthebadge.com)\n\nThis assignment uses x86-64 instruction set. You can find a cheatsheet [here](https://github.com/aadilmehdis/Computer-System-Organisation-2020/tree/master/Resources/x86).\n\nThis was done as a part of the Computer System Organisation course, Spring 2021\n\n---\n\n## Problem 1\n\nCheck if a given integer (64-bit) number, N, contains an odd number of 1s in its bit representation.\n\n### Input/Output Format\n- **INPUT**: You will be given an integer N.\n- **OUTPUT**: TRUE, if the given number contains odd number of 1(s), FALSE otherwise.\n\n### Sample Test Case\n**Input**: N = 153 \\\n**Output**: FALSE \\\n*Note: Bit-wise representation of 153 = 010011001*\n\n\u003cbr\u003e\n\n## Problem 2\n\nGiven a matrix A of dimension N x M. Find the transpose of the matrix A.\n\n### Input/Output Format\n- **INPUT** : N, M, and A.\n- **OUTPUT**: Transpose of matrix A\n\n### Sample Test Case\n**Input** : \\\n2 3 \\\n1 2 9 \\\n0 4 7 \\\n**Output**: \\\n1 0 \\\n2 4 \\\n9 7 \n\n\u003cbr\u003e\n\n## Problem 3\n\nGiven integers N and M. Find modulo of sum of the prime numbers less than N with M.\n\n### Input/Output Format\n- **INPUT** : N, M.\n- **OUTPUT**: (Sum of prime number less than N)% M.\n\n### Sample Test Case\n**Input** : 10 999 \\\n**Output**: 17","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodelixir%2Fassembly-x86-64","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodelixir%2Fassembly-x86-64","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodelixir%2Fassembly-x86-64/lists"}