What This Document Is
This is a homework assignment for CEG 320, Computer Organization, at Wright State University. It focuses on core concepts within assembly language programming – specifically, the implementation and utilization of symbol tables and assembler directives. The assignment challenges students to apply their understanding of how assemblers translate human-readable code into machine-executable instructions. It requires analyzing how directives influence memory allocation and how symbols are represented and resolved during the assembly process.
Why This Document Matters
This assignment is crucial for students learning assembly language and computer architecture. Successfully completing it demonstrates a solid grasp of how assemblers manage data and code locations. It’s particularly beneficial for students preparing for more advanced topics in operating systems, compilers, and embedded systems, where a deep understanding of memory management and instruction encoding is essential. If you’re currently studying assembler directives (ORG, DC.W, DS.W, EQU, DCL) and symbol table construction, working through these problems will significantly reinforce your learning.
Common Limitations or Challenges
This assignment focuses on the *conceptual* understanding of symbol tables and directives. It does not provide a complete, step-by-step guide to building a full assembler. It also assumes prior knowledge of basic assembly language instructions (MOVE.W, MOVE.L) and data representation. The assignment requires independent application of principles learned in class and doesn’t offer pre-solved examples. It’s designed to test your ability to *apply* knowledge, not simply recall it.
What This Document Provides
* A series of problems centered around common assembler directives.
* Scenarios requiring analysis of symbol table entries and their corresponding memory addresses.
* Exercises involving the translation of assembly instructions during the second pass of an assembler.
* Opportunities to predict the contents of registers after instruction execution.
* A framework for understanding how symbolic names are resolved into numerical addresses.
