How derko510/cse-101 works
Main Components
• Inside it, represent each assignment as a separate component: pa1, pa2, pa3, pa4, pa5, pa6, pa7, pa8.
– pa1: Lexical analysis (Lex.c) + list operations.
– pa2: Graph path finding and related list and graph utilities.
– pa3: Graph connectivity (finding components) and graph testing.
– pa4: Matrix operations (Matrix, Sparse), plus list operations.
– pa5: List manipulation (with advanced C++ usage) and shuffle functionality.
– pa6: Big integer arithmetic (Arithmetic.cpp, BigInteger.cpp) with list operations.
– pa7: Dictionary operations and ordering.
– pa8: Dictionary and word frequency analysis.
Interactions and Dependencies
• Within each PA component, outline the internal modules:
– Main application logic files (e.g., Lex.c, FindPath.c, FindComponents.c, etc.)
– Supporting data structures (e.g., List, Graph, Matrix, Dictionary, BigInteger).
– Test modules that validate each core component (e.g., ListTest.c, GraphTest.c, BigIntegerTest.cpp).
– The Makefile acts as a build orchestrator.
Architectural Patterns and Design Principles
• The main algorithm/module (e.g., Lex.c in pa1, FindPath.c in pa2, etc.).
• Supporting modules (e.g., List components, Graph modules, etc.).
• Test modules connected to their respective core components.
• The Makefile as a “build” component interacting with all code files.
• Data flow from the “main” file to the supporting modules.
• Interaction between tests and corresponding modules.
• The orchestration provided by the build process (Makefile) that compiles the system.
• Core functionality modules (rectangles)
• pa2 and pa3 both depend on a Graph abstraction.
• pa7 and pa8 both involve Dictionary functionality, with pa8 further processing word frequency analysis.