From 4a3737e039b1b13ec6e2ef15d55be13ceb3ae9c2 Mon Sep 17 00:00:00 2001 From: user1002 Date: Fri, 14 Nov 2025 18:21:14 +0200 Subject: [PATCH 01/10] simo's branch --- simo.txt | 1 + 1 file changed, 1 insertion(+) create mode 100644 simo.txt diff --git a/simo.txt b/simo.txt new file mode 100644 index 0000000..13f8211 --- /dev/null +++ b/simo.txt @@ -0,0 +1 @@ +Made by Simeon Mladenov KT 24101010 \ No newline at end of file From 0280dc4f90dcf5d91225b2c83af14f94ca3f6384 Mon Sep 17 00:00:00 2001 From: user1002 Date: Fri, 14 Nov 2025 18:24:35 +0200 Subject: [PATCH 02/10] zadacha 1 --- miniproject-1-codex9/codex9.py | 10 +++++++++- 1 file changed, 9 insertions(+), 1 deletion(-) diff --git a/miniproject-1-codex9/codex9.py b/miniproject-1-codex9/codex9.py index e4ec85c..ce0cacb 100644 --- a/miniproject-1-codex9/codex9.py +++ b/miniproject-1-codex9/codex9.py @@ -54,7 +54,15 @@ def decode_fragment(fragment: str) -> list: ['code', 'python', 'Data', 'structure', 'Algorithms'] """ # TODO: Implement the decoding logic here - pass + if not fragment: + return [] + + parts = fragment.split(";") + + decoded = [p[::-1] for p in parts if p] + + return decoded + # ======================================================= From 74fa97608897dd5ee6f03b1209af3ee52601d87b Mon Sep 17 00:00:00 2001 From: GeorgiBG1 <106078946+GeorgiBG1@users.noreply.github.com> Date: Fri, 14 Nov 2025 18:37:53 +0200 Subject: [PATCH 03/10] Update team name and member IDs in codex9.py --- miniproject-1-codex9/codex9.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/miniproject-1-codex9/codex9.py b/miniproject-1-codex9/codex9.py index ce0cacb..46cb36a 100644 --- a/miniproject-1-codex9/codex9.py +++ b/miniproject-1-codex9/codex9.py @@ -3,8 +3,8 @@ 🧩 Mini Project: The Data Heist of Codex-9 ========================================================= -TEAM: # Your team's name -MEMBERS: # List of team members +TEAM: # C++ +MEMBERS: # 24101010, 24071004 STORY: The AI system Codex-9 has been hacked. Fragments of its digital blueprint From bbbc6d939eb466dd4dcb118e728167d3de6a970f Mon Sep 17 00:00:00 2001 From: simo8902 Date: Fri, 14 Nov 2025 18:43:27 +0200 Subject: [PATCH 04/10] Co-authored-by: GeorgiBG1 --- miniproject-1-codex9/codex9.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/miniproject-1-codex9/codex9.py b/miniproject-1-codex9/codex9.py index ce0cacb..46cb36a 100644 --- a/miniproject-1-codex9/codex9.py +++ b/miniproject-1-codex9/codex9.py @@ -3,8 +3,8 @@ 🧩 Mini Project: The Data Heist of Codex-9 ========================================================= -TEAM: # Your team's name -MEMBERS: # List of team members +TEAM: # C++ +MEMBERS: # 24101010, 24071004 STORY: The AI system Codex-9 has been hacked. Fragments of its digital blueprint From c2e805e2e18ca7abbb65f174890e8cf9b5eb27a7 Mon Sep 17 00:00:00 2001 From: simo8902 Date: Fri, 14 Nov 2025 18:58:12 +0200 Subject: [PATCH 05/10] test --- .../INSTRUCTIONS.md | 0 .../codex9.py | 2 +- .../test_codex9.py | 0 simo.txt | 1 - 4 files changed, 1 insertion(+), 2 deletions(-) rename {miniproject-1-codex9 => miniproject-1-codex9-ilysimo}/INSTRUCTIONS.md (100%) rename {miniproject-1-codex9 => miniproject-1-codex9-ilysimo}/codex9.py (99%) rename {miniproject-1-codex9 => miniproject-1-codex9-ilysimo}/test_codex9.py (100%) delete mode 100644 simo.txt diff --git a/miniproject-1-codex9/INSTRUCTIONS.md b/miniproject-1-codex9-ilysimo/INSTRUCTIONS.md similarity index 100% rename from miniproject-1-codex9/INSTRUCTIONS.md rename to miniproject-1-codex9-ilysimo/INSTRUCTIONS.md diff --git a/miniproject-1-codex9/codex9.py b/miniproject-1-codex9-ilysimo/codex9.py similarity index 99% rename from miniproject-1-codex9/codex9.py rename to miniproject-1-codex9-ilysimo/codex9.py index 46cb36a..6bf280c 100644 --- a/miniproject-1-codex9/codex9.py +++ b/miniproject-1-codex9-ilysimo/codex9.py @@ -60,7 +60,7 @@ def decode_fragment(fragment: str) -> list: parts = fragment.split(";") decoded = [p[::-1] for p in parts if p] - + return decoded diff --git a/miniproject-1-codex9/test_codex9.py b/miniproject-1-codex9-ilysimo/test_codex9.py similarity index 100% rename from miniproject-1-codex9/test_codex9.py rename to miniproject-1-codex9-ilysimo/test_codex9.py diff --git a/simo.txt b/simo.txt deleted file mode 100644 index 13f8211..0000000 --- a/simo.txt +++ /dev/null @@ -1 +0,0 @@ -Made by Simeon Mladenov KT 24101010 \ No newline at end of file From f23d3ef8244f495ba56c8e80f04eccc0244c1986 Mon Sep 17 00:00:00 2001 From: simo8902 Date: Fri, 14 Nov 2025 19:43:24 +0200 Subject: [PATCH 06/10] zad 5 --- miniproject-1-codex9-ilysimo/codex9.py | 38 ++++++++++++++++++-------- 1 file changed, 27 insertions(+), 11 deletions(-) diff --git a/miniproject-1-codex9-ilysimo/codex9.py b/miniproject-1-codex9-ilysimo/codex9.py index 6bf280c..4ff435e 100644 --- a/miniproject-1-codex9-ilysimo/codex9.py +++ b/miniproject-1-codex9-ilysimo/codex9.py @@ -85,9 +85,9 @@ def organize_segments(words: list, module_numbers: list) -> list: Example Output: [('code', 104), ('python', 215), ('Data', 309), ('structure', 412), ('Algorithms', 518)] """ - # TODO: Combine words and IDs into tuples - pass - + if len(words) != len(module_numbers): + raise ValueError(f"Length mismatch") + return list(zip(words, module_numbers)) # ======================================================= # 🧩 TASK 3 β€” Verify Module Uniqueness (Sets) @@ -108,7 +108,7 @@ def unique_modules(modules: list) -> list: [('code', 104), ('python', 215)] """ # TODO: Convert to set and back to list - pass + return 0 # ======================================================= @@ -131,8 +131,13 @@ def build_restoration_queue(unique_list: list) -> list: [104, 215, 309] """ # TODO: Use deque for queue logic - pass + q = deque() + for _, module_id in unique_list: + q.append(module_id) + return [q.popleft() for _ in range(len(q))] + + # ======================================================= # 🧩 TASK 5 β€” Track Actions with Stack (Stack) # ======================================================= @@ -155,7 +160,18 @@ def track_actions(module_ids: list) -> list: ['load_104', 'verify_215'] """ # TODO: Use list as stack and pop last 3 - pass + stack = [] + for i, mid in enumerate(module_ids): + if i % 2 == 0: + stack.append(f"{mid}") + else: + stack.append(f"{mid}") + + if len(stack) > 3: + stack = stack[:-3] + else: + stack = [] + return stack # ======================================================= @@ -185,7 +201,7 @@ def map_actions_to_metadata(actions: list, metadata: dict) -> dict: } """ # TODO: Extract module IDs from actions and map metadata - pass + return 0 # ======================================================= @@ -207,7 +223,7 @@ def quick_sort_modules(modules: list) -> list: [(309, 2.1), (104, 3.4), (215, 5.2)] """ # TODO: Implement quick sort - pass + return 0 # ======================================================= @@ -249,7 +265,7 @@ def inorder_bst(root: BSTNode) -> list: root (BSTNode): The root of the BST. """ # TODO: Implement inorder traversal - pass + return 0 @@ -277,7 +293,7 @@ def build_dependency_graph(connection_map: dict) -> dict: Same dictionary (adjacency list) """ # TODO: Return adjacency list - pass + return 0 # ======================================================= @@ -309,6 +325,6 @@ def dfs_activation(graph: dict, start: str) -> list: System Message: Blueprint successfully restored. Codex-9 reboot complete. """ # TODO: Implement recursive DFS - pass + return 0 From 0ca4040fa773a9874b98b4cc83336ba3eaf8f487 Mon Sep 17 00:00:00 2001 From: Aleksandar Karastoyanov Date: Fri, 14 Nov 2025 19:50:48 +0200 Subject: [PATCH 07/10] Update test path for Codex9 tests --- .github/workflows/test_codex9.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/test_codex9.yml b/.github/workflows/test_codex9.yml index 236bf3e..7c43fd2 100644 --- a/.github/workflows/test_codex9.yml +++ b/.github/workflows/test_codex9.yml @@ -28,4 +28,4 @@ jobs: - name: Run Codex9 Tests run: | echo "πŸ” Running unit tests..." - pytest -q test_codex9.py + pytest -q miniproject-1-codex9-ilysimo/test_codex9.py From c8cd8d9d7345fff9e785b69af805f3c970ea5a06 Mon Sep 17 00:00:00 2001 From: simo8902 Date: Thu, 20 Nov 2025 00:03:01 +0200 Subject: [PATCH 08/10] test --- LICENSE | 674 ------------------- README.md | 105 --- miniproject-1-codex9-ilysimo/INSTRUCTIONS.md | 166 ----- miniproject-1-codex9-ilysimo/codex9.py | 330 --------- miniproject-1-codex9-ilysimo/test_codex9.py | 107 --- 5 files changed, 1382 deletions(-) delete mode 100644 LICENSE delete mode 100644 README.md delete mode 100644 miniproject-1-codex9-ilysimo/INSTRUCTIONS.md delete mode 100644 miniproject-1-codex9-ilysimo/codex9.py delete mode 100644 miniproject-1-codex9-ilysimo/test_codex9.py diff --git a/LICENSE b/LICENSE deleted file mode 100644 index f288702..0000000 --- a/LICENSE +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The GNU General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. - - To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, receive -or can get the source code. And you must show them these terms so they -know their rights. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - - Each version is given a distinguishing version number. If the -Program specifies that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY -OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, -THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM -IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF -ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY -GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE -USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF -DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD -PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), -EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF -SUCH DAMAGES. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU General Public License does not permit incorporating your program -into proprietary programs. If your program is a subroutine library, you -may consider it more useful to permit linking proprietary applications with -the library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. But first, please read -. diff --git a/README.md b/README.md deleted file mode 100644 index 7aadee6..0000000 --- a/README.md +++ /dev/null @@ -1,105 +0,0 @@ -# Algorithms & Data Structures MiniProjects (Python) - -## SCOPE OF THE REPO -This repository contains mini-projects for **Algorithms and Data Structures** implemented in **Python**. -Each mini-project is designed as a set of **connected tasks**, where the output of one task serves as input for the next. -The main goal is to help students practice: - -- Strings, Lists, Tuples, Sets -- Queue, Deque, Stack -- Dictionaries -- Sorting & Searching Algorithms -- Binary Search Trees (BST) -- Graphs and Graph Traversals -- Datastructes implementation, Problem-solving and Algorithm Design - ---- - - -## MINI-PROJECTS: - -### Miniproject-1: The Data Heist of Codex-9 -The AI system **Codex-9** has been hacked. Fragments of its digital blueprint have been scattered and corrupted across the network. -Your mission as a Forensic Programmer is to restore it **step by step**. - -Each function (Task 1–10) represents a part of the restoration process. -The output from each function becomes the input for the next one. -Complete all tasks to successfully reboot Codex-9! - ---- - - -## INSTRUCTIONS - -1. **Team Setup** - - Work **individually** or in **teams of 1-3**. - - Create a copy of the project dir with the name of your team - ```bash - cp miniproject-1-codex miniproject-1-codex9-team-alpha - ``` - - Fill your team info in the file: - ```python - TEAM: # Your team's name - MEMBERS: # List of team members - ``` - -2. **Task Completion** - - Complete each function according to its **docstring** in project file: - - For Miniproject-1: (`codex9.py`). - - **Do not modify function names, signatures, or docstrings.** - -3. **Testing** - - You can test each function individually before moving to the next. - - Unit tests are in `test_*.py` and will validate your solutions automatically. - -4. **Code Style & Libraries** - - Use **only standard Python libraries**. - - Ensure your code is **clean, readable, and efficient**. - - Comment your code when necessary. - -5. **Git & GitHub Workflow** - - **Create a new branch** for your work: - ```bash - git checkout -b teamname_task_branch - ``` - - Use a **unique branch name** (team + project). - Example: `teamalpha_codex9` - - **Commit your changes** frequently: - ```bash - git add . - git commit -m "Implement tasks 1-3: decode and organize modules" - ``` - - **Push your branch** to GitHub: - ```bash - git push origin teamalpha_codex9 - ``` - - **Open a Pull Request (PR)**: - - Target branch: `master` - - Fill PR description and use the PR template (see below) - - **Review & Tests**: - - Automated unit tests will run on the PR. - - If tests fail, fix the issues, commit, and update your PR. - -6. **Submission** - - Once all tasks are complete and tests pass, your PR will be merged. - - Make sure your branch is up to date with the base branch before merging. - ---- - -## PR TEMPLATE - -Use this template when creating a PR: - -```markdown -# PR Title: Codex-9 Mini-Project Submission Team Alpha - -## Team Info -- Team: # Your team name -- Members: # List of members - -## Summary -Short summary of changes made in this PR. - -## Notes -- Any assumptions or clarifications made during implementation. -- Any known issues (if any). diff --git a/miniproject-1-codex9-ilysimo/INSTRUCTIONS.md b/miniproject-1-codex9-ilysimo/INSTRUCTIONS.md deleted file mode 100644 index f3ae9d3..0000000 --- a/miniproject-1-codex9-ilysimo/INSTRUCTIONS.md +++ /dev/null @@ -1,166 +0,0 @@ -### 🧠 Storyline - -The central AI of Codex-9, a futuristic data fortress, has been hacked. -Fragments of its blueprint code have been scattered in corrupted files. -You are the Forensic Programmer tasked with recovering the blueprint, step by step β€” every operation you perform produces a new dataset you’ll use next. - - - -### 🧠 Project Overview - -* Number of tasks: 10 -* Recommended team size: 1–4 students -* Topics covered: strings, lists, tuples, sets, stacks, queues, dictionaries, searching, sorting, trees, and graphs -* Final goal: Reconstruct a stolen digital blueprint by progressively decoding, organizing, and connecting data pieces. - - -### βš™οΈ TASKS - -#### Task 1: Decode the Fragment -You receive a corrupted data transmission: - -``` -"edoc;nohtyp;ataD;erutcurts;smhtiroglA" -``` - -Write a function that: -* Splits the string by ; -* Reverses each word -* Returns a list of decoded words. - - -```py -['code', 'python', 'Data', 'structure', 'Algorithms'] -``` - - -#### Task 2: Organize the Blueprint Segments - -Each decoded word corresponds to a module number in Codex-9: -```python -module_numbers = [104, 215, 309, 412, 518] -``` - -Combine both lists (from Task 1 and above) into a list of tuples - -```python -[('code', 104), ('python', 215), ('Data', 309), ('structure', 412), ('Algorithms', 518)] -``` - - -#### Task 3: Verify Module Uniqueness - -Some tuples may repeat due to transmission errors. -Convert your tuple list into a set to remove duplicates. -Then convert back to a list and return the list of unique tuples. - -```py -[('python', 215), ('structure', 412), ('Algorithms', 518), ('code', 104), ('Data', 309)] -``` - -#### Task 4: Build the Restoration Queue - -Modules must be rebuilt in the order they were received. -Use a queue (collections.deque) to enqueue all unique modules. -Then simulate restoring them one by one and return the list of restored modules IDs in the order processed. - -```py -[215, 412, 518, 104, 309] -``` - -#### Task 5: Track Actions with Stack - -While restoring, record your operations (e.g., "load_215", "verify_309") in a stack to support undo. -After processing, pop the last 3 actions to simulate undoing failed repairs. - -Return the list of successful actions after undoing. - -```py -['load_215', 'verify_412'] -``` - -#### Task 6: Map Actions to Metadata - -Now link every successful action to metadata describing module properties: - -```python -metadata = { - 104: {"size": 3.4, "status": "ok"}, - 215: {"size": 5.2, "status": "ok"}, - 309: {"size": 2.1, "status": "ok"}, - 412: {"size": 7.3, "status": "ok"}, - 518: {"size": 4.8, "status": "ok"} -} -``` -Create a dictionary mapping action_name β†’ metadata and return the dictionary. - -```py -{ - "load_215": { - "size": 5.2, - "status": "ok" - }, - "verify_412": { - "size": 4.0, - "status": "ok" - } -} -``` - - -#### Task 7: Sort Modules by Size - -From your dictionary, extract all (module_id, size) pairs. -Implement quick sort to order them by size ascending. -Return the sorted list. - -```py -[('412', 4.0), ('215', 5.2)] -``` - -#### Task 8: Build the Integrity Tree - -Insert each (module_id, size) pair into a Binary Search Tree, where the key is size. -Implement: -* Node class -* Insert function -* Inorder traversal (to confirm sorted order) - -Return the inorder traversal list of module IDs (should match Task 7). - -```py -[(412, 4.0), (215, 5.2)] -``` - -##### Task 9: Connect Modules with Graph - -Now that all modules are repaired, you receive a connection map defining dependencies between module IDs: - -```json -{ - "104": ["215", "309"], - "215": ["412"], - "309": ["518"], - "412": ["518"], - "518": [] -} -``` - -Represent this as an adjacency list (dictionary of lists). -Return the adjacency list(should match the connection map). - -```py -{'104': ['215', '309'], '215': ['412'], '309': ['518'], '412': ['518'], '518': []} -``` - -##### Task 10: Reboot Codex-9 - -Implement Depth-First Search (DFS) on your graph to determine the sequence of module activations needed to reboot Codex-9. -Start from the smallest module ID (by numeric value). -Each node visited represents an activated module. - - -```py -(['104', '215', '412', '518', '309'], -'Blueprint successfully restored. Codex-9 reboot complete.') -``` \ No newline at end of file diff --git a/miniproject-1-codex9-ilysimo/codex9.py b/miniproject-1-codex9-ilysimo/codex9.py deleted file mode 100644 index 4ff435e..0000000 --- a/miniproject-1-codex9-ilysimo/codex9.py +++ /dev/null @@ -1,330 +0,0 @@ -""" -========================================================= - 🧩 Mini Project: The Data Heist of Codex-9 -========================================================= - -TEAM: # C++ -MEMBERS: # 24101010, 24071004 - -STORY: -The AI system Codex-9 has been hacked. Fragments of its digital blueprint -have been scattered and corrupted across the network. -Your mission as the Forensic Programmer is to restore it step by step. - -Each function (Task 1–10) represents a part of the restoration process. -The output from each function becomes the input for the next one. -Complete all tasks to successfully reboot Codex-9! - -INSTRUCTIONS: -1. Complete each function according to its docstring. -2. Use only standard Python libraries. Do not import external packages. -3. You can test each function individually before proceeding to the next. -4. Do not change the function signatures, docstrings, names & arguments. -5. Ensure your code is clean, well-commented, and efficient. -6. Upon completion, Codex-9 should reboot successfully! -7. After completing all tasks, commit your changes to your branch and raise a pull request. Unit Tests will be executed automatically to validate your solutions. -8. If all tests pass and after your submission is approved, your code will be merged into the master branch. -9. In case that tests fail or you get code reviews, address the issues, commit the changes in your branch and update the pull request. - -========================================================= -""" - -from collections import deque -import json -import heapq - - -# ======================================================= -# 🧩 TASK 1 β€” Decode the Fragment (Strings β†’ Lists) -# ======================================================= -def decode_fragment(fragment: str) -> list: - """ - Splits a corrupted string by ';', reverses each segment, - and returns a list of decoded words. - - Arguments: - fragment (str): A semicolon-separated string of corrupted words. - - Returns: - list: A list of decoded words. - - Example Input: - "edoc;nohtyp;ataD;erutcurts;smhtiroglA" - Example Output: - ['code', 'python', 'Data', 'structure', 'Algorithms'] - """ - # TODO: Implement the decoding logic here - if not fragment: - return [] - - parts = fragment.split(";") - - decoded = [p[::-1] for p in parts if p] - - return decoded - - - -# ======================================================= -# 🧩 TASK 2 β€” Organize the Blueprint Segments (Lists β†’ Tuples) -# ======================================================= -def organize_segments(words: list, module_numbers: list) -> list: - """ - Combines two lists into a list of tuples (word, id). - - Arguments: - words (list): A list of decoded words. - module_numbers (list): A list of corresponding module IDs. - - Returns: - list: A list of tuples where each tuple contains a word and its corresponding ID. - - Example Input: - words = ['code', 'python', 'Data', 'structure', 'Algorithms'] - module_numbers = [104, 215, 309, 412, 518] - Example Output: - [('code', 104), ('python', 215), ('Data', 309), ('structure', 412), ('Algorithms', 518)] - """ - if len(words) != len(module_numbers): - raise ValueError(f"Length mismatch") - return list(zip(words, module_numbers)) - -# ======================================================= -# 🧩 TASK 3 β€” Verify Module Uniqueness (Sets) -# ======================================================= -def unique_modules(modules: list) -> list: - """ - Removes duplicate module tuples and returns a list of unique ones. - - Arguments: - modules (list): A list of tuples (word, id) which may contain duplicates. - - Returns: - list: A list of unique module tuples. - - Example Input: - [('code', 104), ('python', 215), ('python', 215)] - Example Output: - [('code', 104), ('python', 215)] - """ - # TODO: Convert to set and back to list - return 0 - - -# ======================================================= -# 🧩 TASK 4 β€” Build the Restoration Queue (Queue) -# ======================================================= -def build_restoration_queue(unique_list: list) -> list: - """ - Simulates restoring modules using a FIFO queue. - Prints restoration messages and returns the order of restored module IDs. - - Arguments: - unique_list (list): A list of unique module tuples (word, id). - - Returns: - list: A list of restored module IDs in the order they were processed. - - Example Input: - [('code', 104), ('python', 215), ('Data', 309)] - Example Output: - [104, 215, 309] - """ - # TODO: Use deque for queue logic - q = deque() - for _, module_id in unique_list: - q.append(module_id) - return [q.popleft() for _ in range(len(q))] - - - -# ======================================================= -# 🧩 TASK 5 β€” Track Actions with Stack (Stack) -# ======================================================= -def track_actions(module_ids: list) -> list: - """ - Simulates restoring modules and tracks operations in a stack. - Pops the last three actions to simulate undo. - - Arguments: - module_ids (list): A list of module IDs to be restored. - - Returns: - list: A list of remaining actions after undoing the last three. - - Example Input: - [104, 215, 309, 412, 518] - Example Output: - ['load_104', 'verify_215', 'load_309', 'verify_412', 'load_518'] - (after 3 undos) - ['load_104', 'verify_215'] - """ - # TODO: Use list as stack and pop last 3 - stack = [] - for i, mid in enumerate(module_ids): - if i % 2 == 0: - stack.append(f"{mid}") - else: - stack.append(f"{mid}") - - if len(stack) > 3: - stack = stack[:-3] - else: - stack = [] - return stack - - -# ======================================================= -# 🧩 TASK 6 β€” Map Actions to Metadata (Dictionaries) -# ======================================================= -def map_actions_to_metadata(actions: list, metadata: dict) -> dict: - """ - Maps action names to their metadata using module IDs. - - Arguments: - actions (list): A list of action names in the format 'action_moduleID'. - metadata (dict): A dictionary mapping module IDs to their metadata. - - Returns: - dict: A dictionary mapping action names to their corresponding metadata. - - Example Input: - actions = ['load_104', 'verify_215'] - metadata = { - 104: {"size": 3.4, "status": "ok"}, - 215: {"size": 5.2, "status": "ok"} - } - Example Output: - { - 'load_104': {'size': 3.4, 'status': 'ok'}, - 'verify_215': {'size': 5.2, 'status': 'ok'} - } - """ - # TODO: Extract module IDs from actions and map metadata - return 0 - - -# ======================================================= -# 🧩 TASK 7 β€” Sort Modules by Size (Sorting Algorithm) -# ======================================================= -def quick_sort_modules(modules: list) -> list: - """ - Implements quick sort to order (id, size) pairs by size ascending. - - Arguments: - modules (list): A list of tuples (id, size). - - Returns: - list: A list of tuples sorted by size in ascending order. - - Example Input: - [(104, 3.4), (215, 5.2), (309, 2.1)] - Example Output: - [(309, 2.1), (104, 3.4), (215, 5.2)] - """ - # TODO: Implement quick sort - return 0 - - -# ======================================================= -# 🧩 TASK 8 β€” Build the Integrity Tree (Binary Search Tree) -# ======================================================= -class BSTNode: - """A node in a binary search tree. - - Attributes: - key (int): The module ID. - value (float): The module size. - left (BSTNode): Left child node. - right (BSTNode): Right child node. - - """ - def __init__(self, key, value): - self.key = key - self.value = value - self.left = None - self.right = None - -def insert_bst(root: BSTNode, key: int, value: float) -> BSTNode: - """ - Inserts (id, size) into BST ordered by size. - - Arguments: - root (BSTNode): The root of the BST. - key (int): The module ID. - value (float): The module size. - """ - # TODO: Insert node correctly - pass - -def inorder_bst(root: BSTNode) -> list: - """ - Returns inorder traversal of BST as list of (id, size) pairs. - - Arguments: - root (BSTNode): The root of the BST. - """ - # TODO: Implement inorder traversal - return 0 - - - -# ======================================================= -# 🧩 TASK 9 β€” Connect the Modules (Graph) -# ======================================================= -def build_dependency_graph(connection_map: dict) -> dict: - """ - Builds adjacency list representing module dependencies. - - Arguments: - connection_map (dict): A dictionary mapping module IDs to lists of dependent module IDs. - Returns: - dict: An adjacency list representing the graph of module dependencies. - - Example Input: - { - "104": ["215", "309"], - "215": ["412"], - "309": ["518"], - "412": ["518"], - "518": [] - } - Example Output: - Same dictionary (adjacency list) - """ - # TODO: Return adjacency list - return 0 - - -# ======================================================= -# 🧩 TASK 10 β€” Reboot Codex-9 (Graph Traversal) -# ======================================================= -def dfs_activation(graph: dict, start: str) -> list: - """ - Performs Depth-First Search (DFS) to determine activation order. - - Arguments: - graph (dict): An adjacency list representing module dependencies. - start (str): The starting module ID for activation. - - Returns: - list: A list of module IDs in the order they are activated. - str: A system message indicating successful reboot. - - Example Input: - { - "104": ["215", "309"], - "215": ["412"], - "309": ["518"], - "412": ["518"], - "518": [] - }, start="104" - - Example Output: - Activation order: ['104', '215', '412', '518', '309'] - System Message: Blueprint successfully restored. Codex-9 reboot complete. - """ - # TODO: Implement recursive DFS - return 0 - - diff --git a/miniproject-1-codex9-ilysimo/test_codex9.py b/miniproject-1-codex9-ilysimo/test_codex9.py deleted file mode 100644 index 8343333..0000000 --- a/miniproject-1-codex9-ilysimo/test_codex9.py +++ /dev/null @@ -1,107 +0,0 @@ -import unittest -from codex9 import (decode_fragment, organize_segments, unique_modules, - build_restoration_queue, track_actions, - map_actions_to_metadata, quick_sort_modules, - insert_bst, inorder_bst, build_dependency_graph, - dfs_activation) - -class TestCodex9Project(unittest.TestCase): - """Unit tests for the codex9 mini-project tasks. - - Args: - unittest: Python's built-in unit testing framework. - - Methods: - test_task1_decode_fragment: Tests decoding of corrupted string fragments. - test_task2_organize_segments: Tests organizing words and IDs into tuples. - test_task3_unique_modules: Tests verification of unique module tuples. - test_task4_build_restoration_queue: Tests building a restoration queue from module data. - test_task5_track_actions: Tests tracking actions with undo functionality. - test_task6_map_actions_to_metadata: Tests mapping actions to metadata. - test_task7_quick_sort_modules: Tests quick sorting of modules by size. - test_task8_integrity_bst: Tests building and traversing a binary search tree. - test_task9_build_dependency_graph: Tests building a dependency graph from connections. - test_task10_dfs_activation: Tests depth-first search activation of modules. - """ - - def test1_task1_decode_fragment(self): - self.assertEqual(decode_fragment("edoc;nohtyp;ataD"), ['code', 'python', 'Data']) - - def test2_task1_decode_fragment(self): - self.assertEqual(decode_fragment("olleh;dlrow"), ['hello', 'world']) - - def test3_task1_decode_fragment(self): - self.assertEqual(decode_fragment("1tupni;2tuptuo;3elif"), ['input1', 'output2', 'file3']) - - def test1_task2_organize_segments_var1(self): - words = ['code', 'python', 'Data'] - ids = [101, 202, 303] - expected = [('code', 101), ('python', 202), ('Data', 303)] - self.assertEqual(organize_segments(words, ids), expected) - - def test_task3_unique_modules(self): - data = [('code', 104), ('python', 215), ('python', 215)] - expected = [('code', 104), ('python', 215)] - self.assertEqual(sorted(unique_modules(data)), sorted(expected)) - - def test_task4_build_restoration_queue(self): - data = [('code', 104), ('python', 215), ('Data', 309)] - self.assertEqual(build_restoration_queue(data), [104, 215, 309]) - - def test_task5_track_actions(self): - ids = [104, 215, 309, 412, 518] - output = track_actions(ids) - # Check first part of list after 3 undos - self.assertTrue(output == ['load_104', 'verify_215']) - - def test_task6_map_actions_to_metadata(self): - actions = ['load_104', 'verify_215'] - metadata = { - 104: {"size": 3.4, "status": "ok"}, - 215: {"size": 5.2, "status": "ok"} - } - result = map_actions_to_metadata(actions, metadata) - self.assertIn('load_104', result) - self.assertEqual(result['verify_215']['status'], 'ok') - - def test_task7_quick_sort_modules(self): - modules = [(104, 3.4), (215, 5.2), (309, 2.1)] - expected = [(309, 2.1), (104, 3.4), (215, 5.2)] - self.assertEqual(quick_sort_modules(modules), expected) - - def test_task8_integrity_bst(self): - data = [(309, 2.1), (104, 3.4), (215, 5.2)] - root = None - for mid, size in data: - root = insert_bst(root, mid, size) - traversal = inorder_bst(root) - self.assertEqual(traversal, [(309, 2.1), (104, 3.4), (215, 5.2)]) - - def test_task9_build_dependency_graph(self): - graph = build_dependency_graph({ - "104": ["215", "309"], - "215": ["412"], - "309": ["518"], - "412": ["518"], - "518": [] - }) - self.assertIn("104", graph) - self.assertIn("518", graph["412"]) - - def test_task10_dfs_activation(self): - graph = { - "104": ["215", "309"], - "215": ["412"], - "309": ["518"], - "412": ["518"], - "518": [] - } - visited, msg = dfs_activation(graph, "104") - self.assertIn('215', visited) - self.assertNotIn('999', visited) - self.assertEqual(visited[-1], '309') - self.assertNotEqual(visited[0], '518') - self.assertEqual(msg, "Blueprint successfully restored. Codex-9 reboot complete.") - -if __name__ == '__main__': - unittest.main() \ No newline at end of file From 3d447ce60bfa3df710cdf8633e9438c3a9f0232a Mon Sep 17 00:00:00 2001 From: simo8902 Date: Thu, 20 Nov 2025 00:30:41 +0200 Subject: [PATCH 09/10] All Done --- LICENSE | 674 +++++++++++++++++++++++ README.md | 105 ++++ miniproject-1-codex9-cpp/INSTRUCTIONS.md | 166 ++++++ miniproject-1-codex9-cpp/codex9.py | 358 ++++++++++++ miniproject-1-codex9-cpp/test_codex9.py | 107 ++++ 5 files changed, 1410 insertions(+) create mode 100644 LICENSE create mode 100644 README.md create mode 100644 miniproject-1-codex9-cpp/INSTRUCTIONS.md create mode 100644 miniproject-1-codex9-cpp/codex9.py create mode 100644 miniproject-1-codex9-cpp/test_codex9.py diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100644 index 0000000..7aadee6 --- /dev/null +++ b/README.md @@ -0,0 +1,105 @@ +# Algorithms & Data Structures MiniProjects (Python) + +## SCOPE OF THE REPO +This repository contains mini-projects for **Algorithms and Data Structures** implemented in **Python**. +Each mini-project is designed as a set of **connected tasks**, where the output of one task serves as input for the next. +The main goal is to help students practice: + +- Strings, Lists, Tuples, Sets +- Queue, Deque, Stack +- Dictionaries +- Sorting & Searching Algorithms +- Binary Search Trees (BST) +- Graphs and Graph Traversals +- Datastructes implementation, Problem-solving and Algorithm Design + +--- + + +## MINI-PROJECTS: + +### Miniproject-1: The Data Heist of Codex-9 +The AI system **Codex-9** has been hacked. Fragments of its digital blueprint have been scattered and corrupted across the network. +Your mission as a Forensic Programmer is to restore it **step by step**. + +Each function (Task 1–10) represents a part of the restoration process. +The output from each function becomes the input for the next one. +Complete all tasks to successfully reboot Codex-9! + +--- + + +## INSTRUCTIONS + +1. **Team Setup** + - Work **individually** or in **teams of 1-3**. + - Create a copy of the project dir with the name of your team + ```bash + cp miniproject-1-codex miniproject-1-codex9-team-alpha + ``` + - Fill your team info in the file: + ```python + TEAM: # Your team's name + MEMBERS: # List of team members + ``` + +2. **Task Completion** + - Complete each function according to its **docstring** in project file: + - For Miniproject-1: (`codex9.py`). + - **Do not modify function names, signatures, or docstrings.** + +3. **Testing** + - You can test each function individually before moving to the next. + - Unit tests are in `test_*.py` and will validate your solutions automatically. + +4. **Code Style & Libraries** + - Use **only standard Python libraries**. + - Ensure your code is **clean, readable, and efficient**. + - Comment your code when necessary. + +5. **Git & GitHub Workflow** + - **Create a new branch** for your work: + ```bash + git checkout -b teamname_task_branch + ``` + - Use a **unique branch name** (team + project). + Example: `teamalpha_codex9` + - **Commit your changes** frequently: + ```bash + git add . + git commit -m "Implement tasks 1-3: decode and organize modules" + ``` + - **Push your branch** to GitHub: + ```bash + git push origin teamalpha_codex9 + ``` + - **Open a Pull Request (PR)**: + - Target branch: `master` + - Fill PR description and use the PR template (see below) + - **Review & Tests**: + - Automated unit tests will run on the PR. + - If tests fail, fix the issues, commit, and update your PR. + +6. **Submission** + - Once all tasks are complete and tests pass, your PR will be merged. + - Make sure your branch is up to date with the base branch before merging. + +--- + +## PR TEMPLATE + +Use this template when creating a PR: + +```markdown +# PR Title: Codex-9 Mini-Project Submission Team Alpha + +## Team Info +- Team: # Your team name +- Members: # List of members + +## Summary +Short summary of changes made in this PR. + +## Notes +- Any assumptions or clarifications made during implementation. +- Any known issues (if any). diff --git a/miniproject-1-codex9-cpp/INSTRUCTIONS.md b/miniproject-1-codex9-cpp/INSTRUCTIONS.md new file mode 100644 index 0000000..f3ae9d3 --- /dev/null +++ b/miniproject-1-codex9-cpp/INSTRUCTIONS.md @@ -0,0 +1,166 @@ +### 🧠 Storyline + +The central AI of Codex-9, a futuristic data fortress, has been hacked. +Fragments of its blueprint code have been scattered in corrupted files. +You are the Forensic Programmer tasked with recovering the blueprint, step by step β€” every operation you perform produces a new dataset you’ll use next. + + + +### 🧠 Project Overview + +* Number of tasks: 10 +* Recommended team size: 1–4 students +* Topics covered: strings, lists, tuples, sets, stacks, queues, dictionaries, searching, sorting, trees, and graphs +* Final goal: Reconstruct a stolen digital blueprint by progressively decoding, organizing, and connecting data pieces. + + +### βš™οΈ TASKS + +#### Task 1: Decode the Fragment +You receive a corrupted data transmission: + +``` +"edoc;nohtyp;ataD;erutcurts;smhtiroglA" +``` + +Write a function that: +* Splits the string by ; +* Reverses each word +* Returns a list of decoded words. + + +```py +['code', 'python', 'Data', 'structure', 'Algorithms'] +``` + + +#### Task 2: Organize the Blueprint Segments + +Each decoded word corresponds to a module number in Codex-9: +```python +module_numbers = [104, 215, 309, 412, 518] +``` + +Combine both lists (from Task 1 and above) into a list of tuples + +```python +[('code', 104), ('python', 215), ('Data', 309), ('structure', 412), ('Algorithms', 518)] +``` + + +#### Task 3: Verify Module Uniqueness + +Some tuples may repeat due to transmission errors. +Convert your tuple list into a set to remove duplicates. +Then convert back to a list and return the list of unique tuples. + +```py +[('python', 215), ('structure', 412), ('Algorithms', 518), ('code', 104), ('Data', 309)] +``` + +#### Task 4: Build the Restoration Queue + +Modules must be rebuilt in the order they were received. +Use a queue (collections.deque) to enqueue all unique modules. +Then simulate restoring them one by one and return the list of restored modules IDs in the order processed. + +```py +[215, 412, 518, 104, 309] +``` + +#### Task 5: Track Actions with Stack + +While restoring, record your operations (e.g., "load_215", "verify_309") in a stack to support undo. +After processing, pop the last 3 actions to simulate undoing failed repairs. + +Return the list of successful actions after undoing. + +```py +['load_215', 'verify_412'] +``` + +#### Task 6: Map Actions to Metadata + +Now link every successful action to metadata describing module properties: + +```python +metadata = { + 104: {"size": 3.4, "status": "ok"}, + 215: {"size": 5.2, "status": "ok"}, + 309: {"size": 2.1, "status": "ok"}, + 412: {"size": 7.3, "status": "ok"}, + 518: {"size": 4.8, "status": "ok"} +} +``` +Create a dictionary mapping action_name β†’ metadata and return the dictionary. + +```py +{ + "load_215": { + "size": 5.2, + "status": "ok" + }, + "verify_412": { + "size": 4.0, + "status": "ok" + } +} +``` + + +#### Task 7: Sort Modules by Size + +From your dictionary, extract all (module_id, size) pairs. +Implement quick sort to order them by size ascending. +Return the sorted list. + +```py +[('412', 4.0), ('215', 5.2)] +``` + +#### Task 8: Build the Integrity Tree + +Insert each (module_id, size) pair into a Binary Search Tree, where the key is size. +Implement: +* Node class +* Insert function +* Inorder traversal (to confirm sorted order) + +Return the inorder traversal list of module IDs (should match Task 7). + +```py +[(412, 4.0), (215, 5.2)] +``` + +##### Task 9: Connect Modules with Graph + +Now that all modules are repaired, you receive a connection map defining dependencies between module IDs: + +```json +{ + "104": ["215", "309"], + "215": ["412"], + "309": ["518"], + "412": ["518"], + "518": [] +} +``` + +Represent this as an adjacency list (dictionary of lists). +Return the adjacency list(should match the connection map). + +```py +{'104': ['215', '309'], '215': ['412'], '309': ['518'], '412': ['518'], '518': []} +``` + +##### Task 10: Reboot Codex-9 + +Implement Depth-First Search (DFS) on your graph to determine the sequence of module activations needed to reboot Codex-9. +Start from the smallest module ID (by numeric value). +Each node visited represents an activated module. + + +```py +(['104', '215', '412', '518', '309'], +'Blueprint successfully restored. Codex-9 reboot complete.') +``` \ No newline at end of file diff --git a/miniproject-1-codex9-cpp/codex9.py b/miniproject-1-codex9-cpp/codex9.py new file mode 100644 index 0000000..efe39d1 --- /dev/null +++ b/miniproject-1-codex9-cpp/codex9.py @@ -0,0 +1,358 @@ +""" +========================================================= + 🧩 Mini Project: The Data Heist of Codex-9 +========================================================= + +TEAM: # C++ +MEMBERS: # 24101010, 24071004 + +STORY: +The AI system Codex-9 has been hacked. Fragments of its digital blueprint +have been scattered and corrupted across the network. +Your mission as the Forensic Programmer is to restore it step by step. + +Each function (Task 1–10) represents a part of the restoration process. +The output from each function becomes the input for the next one. +Complete all tasks to successfully reboot Codex-9! + +INSTRUCTIONS: +1. Complete each function according to its docstring. +2. Use only standard Python libraries. Do not import external packages. +3. You can test each function individually before proceeding to the next. +4. Do not change the function signatures, docstrings, names & arguments. +5. Ensure your code is clean, well-commented, and efficient. +6. Upon completion, Codex-9 should reboot successfully! +7. After completing all tasks, commit your changes to your branch and raise a pull request. Unit Tests will be executed automatically to validate your solutions. +8. If all tests pass and after your submission is approved, your code will be merged into the master branch. +9. In case that tests fail or you get code reviews, address the issues, commit the changes in your branch and update the pull request. + +========================================================= +""" + +from collections import deque +import json +import heapq + + +# ======================================================= +# 🧩 TASK 1 β€” Decode the Fragment (Strings β†’ Lists) +# ======================================================= +def decode_fragment(fragment: str) -> list: + """ + Splits a corrupted string by ';', reverses each segment, + and returns a list of decoded words. + + Arguments: + fragment (str): A semicolon-separated string of corrupted words. + + Returns: + list: A list of decoded words. + + Example Input: + "edoc;nohtyp;ataD;erutcurts;smhtiroglA" + Example Output: + ['code', 'python', 'Data', 'structure', 'Algorithms'] + """ + # TODO: Implement the decoding logic here + if not fragment: + return [] + + parts = fragment.split(";") + + decoded = [p[::-1] for p in parts if p] + + return decoded + + + +# ======================================================= +# 🧩 TASK 2 β€” Organize the Blueprint Segments (Lists β†’ Tuples) +# ======================================================= +def organize_segments(words: list, module_numbers: list) -> list: + """ + Combines two lists into a list of tuples (word, id). + + Arguments: + words (list): A list of decoded words. + module_numbers (list): A list of corresponding module IDs. + + Returns: + list: A list of tuples where each tuple contains a word and its corresponding ID. + + Example Input: + words = ['code', 'python', 'Data', 'structure', 'Algorithms'] + module_numbers = [104, 215, 309, 412, 518] + Example Output: + [('code', 104), ('python', 215), ('Data', 309), ('structure', 412), ('Algorithms', 518)] + """ + if len(words) != len(module_numbers): + raise ValueError(f"Length mismatch") + return list(zip(words, module_numbers)) + +# ======================================================= +# 🧩 TASK 3 β€” Verify Module Uniqueness (Sets) +# ======================================================= +def unique_modules(modules: list) -> list: + """ + Removes duplicate module tuples and returns a list of unique ones. + + Arguments: + modules (list): A list of tuples (word, id) which may contain duplicates. + + Returns: + list: A list of unique module tuples. + + Example Input: + [('code', 104), ('python', 215), ('python', 215)] + Example Output: + [('code', 104), ('python', 215)] + """ + # TODO: Convert to set and back to list + return list(set(modules)) + + +# ======================================================= +# 🧩 TASK 4 β€” Build the Restoration Queue (Queue) +# ======================================================= +def build_restoration_queue(unique_list: list) -> list: + """ + Simulates restoring modules using a FIFO queue. + Prints restoration messages and returns the order of restored module IDs. + + Arguments: + unique_list (list): A list of unique module tuples (word, id). + + Returns: + list: A list of restored module IDs in the order they were processed. + + Example Input: + [('code', 104), ('python', 215), ('Data', 309)] + Example Output: + [104, 215, 309] + """ + # TODO: Use deque for queue logic + q = deque() + for _, module_id in unique_list: + q.append(module_id) + return [q.popleft() for _ in range(len(q))] + + + +# ======================================================= +# 🧩 TASK 5 β€” Track Actions with Stack (Stack) +# ======================================================= +def track_actions(module_ids: list) -> list: + """ + Simulates restoring modules and tracks operations in a stack. + Pops the last three actions to simulate undo. + + Arguments: + module_ids (list): A list of module IDs to be restored. + + Returns: + list: A list of remaining actions after undoing the last three. + + Example Input: + [104, 215, 309, 412, 518] + Example Output: + ['load_104', 'verify_215', 'load_309', 'verify_412', 'load_518'] + (after 3 undos) + ['load_104', 'verify_215'] + """ + # TODO: Use list as stack and pop last 3 + stack = [] + for i, mid in enumerate(module_ids): + if i % 2 == 0: + stack.append(f"load_{mid}") + else: + stack.append(f"verify_{mid}") + + if len(stack) > 3: + stack = stack[:-3] + else: + stack = [] + return stack + + +# ======================================================= +# 🧩 TASK 6 β€” Map Actions to Metadata (Dictionaries) +# ======================================================= +def map_actions_to_metadata(actions: list, metadata: dict) -> dict: + """ + Maps action names to their metadata using module IDs. + + Arguments: + actions (list): A list of action names in the format 'action_moduleID'. + metadata (dict): A dictionary mapping module IDs to their metadata. + + Returns: + dict: A dictionary mapping action names to their corresponding metadata. + + Example Input: + actions = ['load_104', 'verify_215'] + metadata = { + 104: {"size": 3.4, "status": "ok"}, + 215: {"size": 5.2, "status": "ok"} + } + Example Output: + { + 'load_104': {'size': 3.4, 'status': 'ok'}, + 'verify_215': {'size': 5.2, 'status': 'ok'} + } + """ + # TODO: Extract module IDs from actions and map metadata + result = {} + for a in actions: + mid = int(a.split("_")[1]) + result[a] = metadata[mid] + return result + + +# ======================================================= +# 🧩 TASK 7 β€” Sort Modules by Size (Sorting Algorithm) +# ======================================================= +def quick_sort_modules(modules: list) -> list: + """ + Implements quick sort to order (id, size) pairs by size ascending. + + Arguments: + modules (list): A list of tuples (id, size). + + Returns: + list: A list of tuples sorted by size in ascending order. + + Example Input: + [(104, 3.4), (215, 5.2), (309, 2.1)] + Example Output: + [(309, 2.1), (104, 3.4), (215, 5.2)] + """ + # TODO: Implement quick sort + if len(modules) <= 1: + return modules + + pivot = modules[0] + left = [x for x in modules[1:] if x[1] <= pivot[1]] + right = [x for x in modules[1:] if x[1] > pivot[1]] + + return quick_sort_modules(left) + [pivot] + quick_sort_modules(right) + + +# ======================================================= +# 🧩 TASK 8 β€” Build the Integrity Tree (Binary Search Tree) +# ======================================================= +class BSTNode: + """A node in a binary search tree. + + Attributes: + key (int): The module ID. + value (float): The module size. + left (BSTNode): Left child node. + right (BSTNode): Right child node. + + """ + def __init__(self, key, value): + self.key = key + self.value = value + self.left = None + self.right = None + +def insert_bst(root: BSTNode, key: int, value: float) -> BSTNode: + """ + Inserts (id, size) into BST ordered by size. + + Arguments: + root (BSTNode): The root of the BST. + key (int): The module ID. + value (float): The module size. + """ + # TODO: Insert node correctly + if root is None: + return BSTNode(key, value) + if value < root.value: + root.left = insert_bst(root.left, key, value) + else: + root.right = insert_bst(root.right, key, value) + return root + +def inorder_bst(root: BSTNode) -> list: + """ + Returns inorder traversal of BST as list of (id, size) pairs. + + Arguments: + root (BSTNode): The root of the BST. + """ + # TODO: Implement inorder traversal + if root is None: + return [] + return inorder_bst(root.left) + [(root.key, root.value)] + inorder_bst(root.right) + + + +# ======================================================= +# 🧩 TASK 9 β€” Connect the Modules (Graph) +# ======================================================= +def build_dependency_graph(connection_map: dict) -> dict: + """ + Builds adjacency list representing module dependencies. + + Arguments: + connection_map (dict): A dictionary mapping module IDs to lists of dependent module IDs. + Returns: + dict: An adjacency list representing the graph of module dependencies. + + Example Input: + { + "104": ["215", "309"], + "215": ["412"], + "309": ["518"], + "412": ["518"], + "518": [] + } + Example Output: + Same dictionary (adjacency list) + """ + # TODO: Return adjacency list + return connection_map + + +# ======================================================= +# 🧩 TASK 10 β€” Reboot Codex-9 (Graph Traversal) +# ======================================================= +def dfs_activation(graph: dict, start: str) -> list: + """ + Performs Depth-First Search (DFS) to determine activation order. + + Arguments: + graph (dict): An adjacency list representing module dependencies. + start (str): The starting module ID for activation. + + Returns: + list: A list of module IDs in the order they are activated. + str: A system message indicating successful reboot. + + Example Input: + { + "104": ["215", "309"], + "215": ["412"], + "309": ["518"], + "412": ["518"], + "518": [] + }, start="104" + + Example Output: + Activation order: ['104', '215', '412', '518', '309'] + System Message: Blueprint successfully restored. Codex-9 reboot complete. + """ + # TODO: Implement recursive DFS + visited = [] + + def dfs(node): + if node in visited: + return + visited.append(node) + for nxt in graph[node]: + dfs(nxt) + + dfs(start) + return visited, "Blueprint successfully restored. Codex-9 reboot complete." + diff --git a/miniproject-1-codex9-cpp/test_codex9.py b/miniproject-1-codex9-cpp/test_codex9.py new file mode 100644 index 0000000..8343333 --- /dev/null +++ b/miniproject-1-codex9-cpp/test_codex9.py @@ -0,0 +1,107 @@ +import unittest +from codex9 import (decode_fragment, organize_segments, unique_modules, + build_restoration_queue, track_actions, + map_actions_to_metadata, quick_sort_modules, + insert_bst, inorder_bst, build_dependency_graph, + dfs_activation) + +class TestCodex9Project(unittest.TestCase): + """Unit tests for the codex9 mini-project tasks. + + Args: + unittest: Python's built-in unit testing framework. + + Methods: + test_task1_decode_fragment: Tests decoding of corrupted string fragments. + test_task2_organize_segments: Tests organizing words and IDs into tuples. + test_task3_unique_modules: Tests verification of unique module tuples. + test_task4_build_restoration_queue: Tests building a restoration queue from module data. + test_task5_track_actions: Tests tracking actions with undo functionality. + test_task6_map_actions_to_metadata: Tests mapping actions to metadata. + test_task7_quick_sort_modules: Tests quick sorting of modules by size. + test_task8_integrity_bst: Tests building and traversing a binary search tree. + test_task9_build_dependency_graph: Tests building a dependency graph from connections. + test_task10_dfs_activation: Tests depth-first search activation of modules. + """ + + def test1_task1_decode_fragment(self): + self.assertEqual(decode_fragment("edoc;nohtyp;ataD"), ['code', 'python', 'Data']) + + def test2_task1_decode_fragment(self): + self.assertEqual(decode_fragment("olleh;dlrow"), ['hello', 'world']) + + def test3_task1_decode_fragment(self): + self.assertEqual(decode_fragment("1tupni;2tuptuo;3elif"), ['input1', 'output2', 'file3']) + + def test1_task2_organize_segments_var1(self): + words = ['code', 'python', 'Data'] + ids = [101, 202, 303] + expected = [('code', 101), ('python', 202), ('Data', 303)] + self.assertEqual(organize_segments(words, ids), expected) + + def test_task3_unique_modules(self): + data = [('code', 104), ('python', 215), ('python', 215)] + expected = [('code', 104), ('python', 215)] + self.assertEqual(sorted(unique_modules(data)), sorted(expected)) + + def test_task4_build_restoration_queue(self): + data = [('code', 104), ('python', 215), ('Data', 309)] + self.assertEqual(build_restoration_queue(data), [104, 215, 309]) + + def test_task5_track_actions(self): + ids = [104, 215, 309, 412, 518] + output = track_actions(ids) + # Check first part of list after 3 undos + self.assertTrue(output == ['load_104', 'verify_215']) + + def test_task6_map_actions_to_metadata(self): + actions = ['load_104', 'verify_215'] + metadata = { + 104: {"size": 3.4, "status": "ok"}, + 215: {"size": 5.2, "status": "ok"} + } + result = map_actions_to_metadata(actions, metadata) + self.assertIn('load_104', result) + self.assertEqual(result['verify_215']['status'], 'ok') + + def test_task7_quick_sort_modules(self): + modules = [(104, 3.4), (215, 5.2), (309, 2.1)] + expected = [(309, 2.1), (104, 3.4), (215, 5.2)] + self.assertEqual(quick_sort_modules(modules), expected) + + def test_task8_integrity_bst(self): + data = [(309, 2.1), (104, 3.4), (215, 5.2)] + root = None + for mid, size in data: + root = insert_bst(root, mid, size) + traversal = inorder_bst(root) + self.assertEqual(traversal, [(309, 2.1), (104, 3.4), (215, 5.2)]) + + def test_task9_build_dependency_graph(self): + graph = build_dependency_graph({ + "104": ["215", "309"], + "215": ["412"], + "309": ["518"], + "412": ["518"], + "518": [] + }) + self.assertIn("104", graph) + self.assertIn("518", graph["412"]) + + def test_task10_dfs_activation(self): + graph = { + "104": ["215", "309"], + "215": ["412"], + "309": ["518"], + "412": ["518"], + "518": [] + } + visited, msg = dfs_activation(graph, "104") + self.assertIn('215', visited) + self.assertNotIn('999', visited) + self.assertEqual(visited[-1], '309') + self.assertNotEqual(visited[0], '518') + self.assertEqual(msg, "Blueprint successfully restored. Codex-9 reboot complete.") + +if __name__ == '__main__': + unittest.main() \ No newline at end of file From c400fe95311b3fdc39ce20a319cfb877d2e2efe3 Mon Sep 17 00:00:00 2001 From: user1002 Date: Fri, 21 Nov 2025 19:06:23 +0200 Subject: [PATCH 10/10] new assignmnet --- miniproject-2-protocol-QV-7/INSTRUCTIONS.md | 210 ++++++++++++ miniproject-2-protocol-QV-7/protocol_qv7.py | 302 ++++++++++++++++++ .../test_protocolqv7.py | 0 3 files changed, 512 insertions(+) create mode 100644 miniproject-2-protocol-QV-7/INSTRUCTIONS.md create mode 100644 miniproject-2-protocol-QV-7/protocol_qv7.py create mode 100644 miniproject-2-protocol-QV-7/test_protocolqv7.py diff --git a/miniproject-2-protocol-QV-7/INSTRUCTIONS.md b/miniproject-2-protocol-QV-7/INSTRUCTIONS.md new file mode 100644 index 0000000..7f6fa07 --- /dev/null +++ b/miniproject-2-protocol-QV-7/INSTRUCTIONS.md @@ -0,0 +1,210 @@ +### 🧠 Storyline + +Deep beneath the abandoned research complex Helion Prime, a classified experimental containment system known as the Quantum Vault has suffered a catastrophic breach. + +Inside the Vault lie encrypted algorithmic artifacts β€” predictive AIs, mathematical models, temporal distortion engines β€” all stored as quantum shards. +When the breach occurred, these shards were fragmented, scrambled, and scattered across corrupted memory sectors. + +The Quantum Recovery Task Unit (you) has been activated. + +### 🧠 Project Overview + +* Number of tasks: 10 +* Recommended team size: 1–4 students +* Topics covered: +Strings, lists, sets, tuples, stacks, queues, dictionaries, searching/sorting algorithms, binary search trees, graphs +* Final goal: Rebuild the Quantum Lattice Map and secure The Vault. + +### βš™οΈ TASKS + +#### Task 1 β€” Extract Quantum Shards + +You are given a corrupted quantum data stream where shards are separated by #. + +``` +"23noitazimitpO#gnirts_001#eman-tceles" +``` + +You must: +* Split the string into fragments +* Reverse each fragment +* Remove all characters except letters, digits, and hyphens +* Return the resulting cleaned list + +```py +['Optimization32', '100_string', 'select-name'] +``` + + +#### Task 2 β€” Pair Shards with Sequence Codes + +You receive a list of decoded shard strings and a list of integer sequence codes. + +You must pair them into tuples: + +```py +(shard_string, code) +``` + +```py +shards = ['alpha', 'beta', 'gamma', 'alpha'] +codes = [7, 12, 18, 22] +``` + +```py +[('alpha', 7), ('beta', 12), ('gamma', 18), ('alpha', 22)] +``` + + +#### TASK 3 β€” Stabilize Shard Registry + +Duplicates may exist due to memory corruption. + +You must: +* Convert the list of shard tuples to a set +* Convert it back to a list +* Return only unique shard entries + +```py +[('alpha', 7), ('beta', 12), ('gamma', 18), ('alpha', 22)] +``` + +```py +[('alpha', 7), ('beta', 12), ('gamma', 18)] +``` + +#### Task 4 β€” Initialize Reconstruction Queue + +Processing must occur in the exact order that unique shard pairs appear. + +```py +[('alpha', 7), ('beta', 12), ('gamma', 18)] +``` + +You must: +* Create a FIFO queue (collections.deque) +* Enqueue each (shard, code) tuple +* Dequeue items one by one +* Return a list only of the sequence codes in processed order + +```py +[7, 12, 18] +``` + +#### TASK 5 β€” Action Log Stack + +For each code, generate two actions: +* `decode_` +* `validate_` + + +```py +[7, 12, 18] +``` + + +```py +['decode_7', 'validate_7', 'decode_12', 'validate_12', 'decode_18', 'validate_18'] +# after removing 2: +['decode_7', 'validate_7', 'decode_12', 'validate_12'] +``` + +#### TASK 6 β€” Annotate Shards + +You must: +* Use each action name (e.g., "decode_7") +* Extract the code (e.g., 7) +* Map the action to metadata found in shard_info[code] + +```py +actions = ['decode_7'] +shard_info = {7: {"energy": 1.2, "state": "stable"}, + 12: {"energy": 2.5, "state": "unstable"}, + 18: {"energy": 3.1, "state": "stable"}, + 22: {"energy": 4.0, "state": "critical"}, + 2: {"energy": 0.9, "state": "stable"}} +``` + + +```py +{'decode_7': {'energy': 1.2, 'state': 'stable'}, + 'validate_7': {'energy': 1.2, 'state': 'stable'}, + 'decode_12': {'energy': 2.5, 'state': 'unstable'}, + 'validate_12': {'energy': 2.5, 'state': 'unstable'}} +``` + + +#### TASK 7 β€” Sort Shards by Energy + +You will receive a list of tuples: + +``` +(code, energy) +``` + +You must: +* Implement a sort algorithm manually(by your choice, e.g., quick sort, merge sort, bubble sort) +* Sort by energy in ascending order +* Return the sorted list + +```py +[(18, 3.1), (7, 1.2), (12, 2.5)] +``` + +```py +[(7, 1.2), (12, 2.5), (18, 3.1)] +``` + + +#### TASK 8 β€” Rebuild Quantum Integrity Tree + +You must implement a Binary Search Tree where: +* The tree is ordered by energy +* Each node stores (code, energy) +* You must implement: + * insert_qv + * inorder_qv + +**Inorder traversal must return items sorted by energy.** + +```py +[(18, 3.1), (2, 0.9), (22, 4.0), (7, 1.2), (12, 2.5)] +``` + +```py +[(2, 0.9), (7, 1.2), (12, 2.5), (18, 3.1), (22, 4.0)] +``` + +#### TASK 9 β€” Build Shard Dependency Map + +You receive a dependency mapping: + +```py +{ + "7": ["12"], + "12": ["18"], + "18": [] +} +``` + +You must return a clean adjacency list (likely identical to input). +Build a Graph representation using a dictionary of lists. + + + +#### TASK 10 β€” Activate Vault Sequence + +Perform a Depth-First Search starting from a given code. + +You must return: +* The activation order (list) +* A final status message + +```py +graph = {"7": ["12"], "12": ["18"], "18": []} +start = "7" +``` + +```py +(['7', '12', '18'], "Quantum Vault fully restored. Protocol QV-7 complete.") +``` diff --git a/miniproject-2-protocol-QV-7/protocol_qv7.py b/miniproject-2-protocol-QV-7/protocol_qv7.py new file mode 100644 index 0000000..e2f8b6a --- /dev/null +++ b/miniproject-2-protocol-QV-7/protocol_qv7.py @@ -0,0 +1,302 @@ +""" +========================================================= + 🧩 Mini Project: The Quantum Vault Breach β€” Protocol QV-7 +========================================================= + +TEAM: # Your team's name +MEMBERS: # List of team members + +STORY: +Deep beneath the abandoned research facility *Helion Prime*, a classified +containment system known as the **Quantum Vault** has been breached. + +Its encrypted artifactsβ€”mathematical models, neural blueprints, and +time-distortion algorithmsβ€”have fragmented into quantum shards scattered +across corrupted memory sectors. + +Your mission as the **Quantum Recovery Task Unit**: +Reconstruct every shard, rebuild the data structures, re-link dependencies, +and stabilize the Vault before the containment field collapses. + +Every function (Task 1–10) represents a stage of the reconstruction protocol. +Output from each task becomes the input for the next one. + +Follow the protocol. Restore the Vault. Prevent total system collapse. + +INSTRUCTIONS: +1. Complete each function according to its docstring. +2. Use only standard Python libraries. Do not import external packages. +3. You may test each function independently. +4. Do not change function names, arguments, or docstrings. +5. Write clean, optimized, well-commented code. +6. When all tasks are completed and unit tests pass, the Vault stabilizes. +7. After finishing: commit β†’ create PR β†’ tests will run automatically. +8. Fix test failures or review comments and update your PR. +9. Only after approval, your code will be merged into the master branch. + +========================================================= +""" + +from collections import deque +import json +import heapq + + +# ======================================================= +# 🧩 TASK 1 β€” Extract Quantum Shards (Strings β†’ List) +# ======================================================= +def extract_shards(corrupted_stream: str) -> list: + """ + Splits a corrupted quantum stream where shards are separated by '#'. + Each shard is reversed and cleaned of non-alphanumeric characters. + + Arguments: + corrupted_stream (str): The raw corrupted shard string. + + Returns: + list: A list of cleaned, decoded shard strings. + + Example Input: + "23noitazimitpO#gnirts_001#eman-tceles" + Example Output: + ['Optimization32', '100_string', 'select-name'] + """ + # TODO: Implement extraction + cleaning + pass + + +# ======================================================= +# 🧩 TASK 2 β€” Pair Shards with Sequence Codes (List β†’ Tuple) +# ======================================================= +def pair_shards(shards: list, codes: list) -> list: + """ + Combines the decoded shard strings with their associated sequence codes + into tuples of the form (shard, code). + + Arguments: + shards (list): List of decoded shard strings. + codes (list): List of integer sequence codes. + + Returns: + list: List of (shard, code) tuples. + + Example: + shards = ['alpha', 'beta', 'gamma', 'alpha'] + codes = [7, 12, 18, 22] + Output: + [('alpha', 7), ('beta', 12), ('gamma', 18), ('alpha', 22)] + """ + # TODO: Combine the two lists into tuples + pass + + +# ======================================================= +# 🧩 TASK 3 β€” Stabilize Shard Registry (Sets) +# ======================================================= +def stabilize_registry(pairs: list) -> list: + """ + Removes duplicate shard entries using a set and returns a list of + unique shard tuples. + + Arguments: + pairs (list): List of (shard, code) tuples that may include duplicates. + + Returns: + list: A list of unique shard tuples. + + Example Input: + [('alpha', 7), ('beta', 12), ('gamma', 18), ('alpha', 22)] + Example Output: + [('alpha', 7), ('beta', 12), ('gamma', 18)] + """ + # TODO: Convert to set then back to list + pass + + +# ======================================================= +# 🧩 TASK 4 β€” Initialize Reconstruction Queue (Queue) +# ======================================================= +def initialize_queue(unique_pairs: list) -> list: + """ + Initializes a FIFO queue using deque and simulates shard processing. + Returns the sequence codes in the order they were handled. + + Arguments: + unique_pairs (list): List of unique (shard, code) tuples. + + Returns: + list: Ordered list of processed sequence codes. + + Example: + [('alpha', 7), ('beta', 12), ('gamma', 18)] + Output: + [7, 12, 18] + """ + # TODO: Use deque to simulate queue operations + pass + + +# ======================================================= +# 🧩 TASK 5 β€” Action Log Stack (Stack) +# ======================================================= +def action_log(codes: list) -> list: + """ + Builds an action log using a LIFO stack where each code generates + 'decode_' and 'validate_' actions. The last two actions + represent corrupted operations and must be removed (undo). + + Arguments: + codes (list): List of sequence codes. + + Returns: + list: Stack after removing the last two invalid operations. + + Example Input: + [7, 12, 18] + Example Generated Actions: + ['decode_7', 'validate_7', 'decode_12', 'validate_12', 'decode_18', 'validate_18'] + after removing 2: + ['decode_7', 'validate_7', 'decode_12', 'validate_12'] + """ + # TODO: Use Python list as stack + pass + + +# ======================================================= +# 🧩 TASK 6 β€” Annotate Shards (Dictionary) +# ======================================================= +def annotate_shards(actions: list, shard_info: dict) -> dict: + """ + Uses the action names (e.g., 'decode_7') to map each action + to its corresponding shard metadata stored in a dictionary. + + Arguments: + actions (list): Action names in the format 'action_code'. + shard_info (dict): Maps integer codes to metadata dictionaries. + + Returns: + dict: Mapping from action name β†’ metadata. + + Example: + actions = ['decode_7'] + shard_info = {7: {"energy": 1.2, "state": "stable"}} + Output: + {'decode_7': {'energy': 1.2, 'state': 'stable'}} + """ + # TODO: Extract code from action name and map + pass + + +# ======================================================= +# 🧩 TASK 7 β€” Sort Shards by Energy (Sorting Algorithm) +# ======================================================= +def merge_sort_energy(shards: list) -> list: + """ + Sorts a list of (code, energy) tuples by energy using merge sort. + + Arguments: + shards (list): List of (code, energy) tuples. + + Returns: + list: Sorted list by ascending energy. + + Example: + [(18, 3.1), (7, 1.2), (12, 2.5)] + Output: + [(7, 1.2), (12, 2.5), (18, 3.1)] + """ + # TODO: Implement merge sort + pass + + +# ======================================================= +# 🧩 TASK 8 β€” Rebuild Quantum Integrity Tree (Binary Search Tree) +# ======================================================= +class QuantumNode: + """A BST node storing code and energy.""" + def __init__(self, code, energy): + self.code = code + self.energy = energy + self.left = None + self.right = None + +def insert_qv(root: QuantumNode, code: int, energy: float) -> QuantumNode: + """ + Inserts (code, energy) into a BST ordered by energy value. + + Arguments: + root (QuantumNode): The root of the BST. + code (int): Sequence code. + energy (float): Energy value. + """ + # TODO: Implement BST insertion logic + pass + + +def inorder_qv(root: QuantumNode) -> list: + """ + Performs an inorder traversal of the Quantum Vault BST. + + Arguments: + root (QuantumNode): BST root. + + Returns: + list: List of (code, energy) tuples sorted by energy. + + Example: + [(18, 3.1), (2, 0.9), (22, 4.0), (7, 1.2), (12, 2.5)] + Output: + [(2, 0.9), (7, 1.2), (12, 2.5), (18, 3.1), (22, 4.0)] + """ + # TODO: Implement inorder traversal + pass + + +# ======================================================= +# 🧩 TASK 9 β€” Build Shard Dependency Map (Graph) +# ======================================================= +def build_shard_graph(mapping: dict) -> dict: + """ + Builds an adjacency list representing quantum shard dependencies. + + Arguments: + mapping (dict): Maps shard codes to a list of dependent codes. + + Returns: + dict: Adjacency list representing the dependency graph. + + Example: + { + "7": ["12"], + "12": ["18"], + "18": [] + } + """ + # TODO: Return adjacency list + pass + + +# ======================================================= +# 🧩 TASK 10 β€” Activate Vault Sequence (DFS Traversal) +# ======================================================= +def dfs_sequence(graph: dict, start: str) -> list: + """ + Performs DFS to determine the activation order of quantum shards. + + Arguments: + graph (dict): Adjacency list of dependencies. + start (str): Starting shard code. + + Returns: + list: Activation order of shard codes. + str: Completion message. + + Example: + graph = {"7": ["12"], "12": ["18"], "18": []} + start = "7" + Output: + ['7', '12', '18'] + "Quantum Vault fully restored. Protocol QV-7 complete." + """ + # TODO: Implement DFS recursively + pass \ No newline at end of file diff --git a/miniproject-2-protocol-QV-7/test_protocolqv7.py b/miniproject-2-protocol-QV-7/test_protocolqv7.py new file mode 100644 index 0000000..e69de29