Difference between revisions of "CSC103 Lab 2"

From dftwiki3
Jump to: navigation, search
(Part 5: Exercise)
(Part 6: Exercise #2)
Line 135: Line 135:
 
  13  32
 
  13  32
  
=Part 6: Exercise #2=
+
=Part 6: A program with a new instruction: JMP=
  
 
* Enter the following program in memory:
 
* Enter the following program in memory:
Line 166: Line 166:
 
* What is the behavior of the program?
 
* What is the behavior of the program?
 
* What do we call such a program?  (Check with your instructor or the TA if you have figured out the right answer.)
 
* What do we call such a program?  (Check with your instructor or the TA if you have figured out the right answer.)
 +
* You may find the '''Stop''' button useful for this exercise!
 +
* You will have figured out that the '''JMP''' instruction stands for JUMP, and forces the processor to jump back to a particular address in memory.  In this case it tells the processor ''JUMP BACK TO ADDRESS 0''. 
 +
* How does the processor actually go back to Address 0?
 +
 +
=Part 7: Exercise #2=
 +
 +
* '''Modify''' the above program so that the number in Memory Address 10 is 1 at the beginning, then 2, then 4, then 8, then 16, then 32, etc...
 +
 +
* In case you were wondering what other instructions are available, you can find a list [[here]]

Revision as of 15:15, 30 September 2008

<meta name="keywords" content="computer science, How Computers Work, Dominique Thiebaut, smith college" /> <meta name="description" content="Dominique Thiebaut's Web Page" /> <meta name="title" content="Dominique Thiebaut -- Computer Science" /> <meta name="abstract" content="Dominique Thiebaut's Computer Science Web pages" /> <meta name="author" content="thiebaut at cs.smith.edu" /> <meta name="distribution" content="Global" /> <meta name="revisit-after" content="10 days" /> <meta name="copyright" content="(c) D. Thiebaut 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,2008" /> <meta name="robots" content="FOLLOW,INDEX" />

Back to CSC103 Main Page

In this lab you will program at the lowest level of programmation: at the assembly language level. You will write small programs in assembly, and see how the programs correspond to numbers that are stored in memory. Some numbers represent instructions, some numbers represent data. But everything in memory is a number! That's a very important concept of CSC103!

Part 1: Starting the simulator

  • Go to the applet page for the class. Click on



CSC103 Launch xComputer.png



  • The processor simulator will pop up.



CSC103 Annotated Simulator.png




The purple part represents what is inside the processor, while the blue part represents the memory. Remember what they look like from the recent lab:


Processor   Memory

CSC103 Pentium.jpg

 

CSC103 SIMM Memory.jpg

Part 2: Loading a constant in the Accumulator

  • First, make sure the top right box displays Instructions as the format of the data in memory.
  • Let's write a 1-instruction program:
0   LOD-C   57
1   HLT
  • Enter 0 in the addr: box, and LOD-C 57 in the data: box. Press Enter to store these values in memory.
  • Enter 1 (if it isn't already there) in the addr: box, and HLT in the data: box. Press Enter to store these values in memory.
  • Make sure the Program Counter is set to 0, otherwise click on the special button for that purpose.
  • Run your program by clicking on the Cycle a few times.
  • Verify that you get the right number in the accumulator register.

CSC103 Assembly 1.png


Part 3: Loading a number in a memory word

  • First make sure that the top right box displays Integers as the format of the data in memory.
  • In the same addr: and data: boxes, enter 10 (for the address), and 73 (for the data). Then press Enter.



CSC103 Store Data In Memory.png



  • Verify that you get the number 73 at Address 10.

Part 4: A program that adds two numbers together

Now that you know how to enter instructions and data in memory, enter the following program in memory (the information following the #-signs represents comments, and shouldn't be entered in memory):

0 LOD 10        # load memory word at address 10 in accumulator
1 ADD 11        # add memory at address 11 to accumulator
2 STO 12        # store accumulator at address 12
3 HLT           # stop program
...
10  22
11  5
12  0
  • Reset PC to 0
  • Click Cycle regularly and observe how the processor goes to memory to fetch instructions, to decode them, and to execute them.
  • Observe how the accumulator changes as the result of the execution of the instructions.
  • Repeat the program a few times (by resetting PC to 0 every time) to make sure you observe everything that is changing in the processor.
  • Another way of running your program is to simply reset PC to 0 and click the Run button. Try it!

Part 5: Exercise #1

Modify your program so that it starts with 3 values at Addresses 10, 11, and 12, and it computes their sum and stores the result at Address 13.

For example, if you start with the following memory contents:

10   22
11    7
12    3
13    0

Then after running your program your memory will contain:

10   22
11    7
12    3
13   32

Part 6: A program with a new instruction: JMP

  • Enter the following program in memory:
0 LOD 10
1 ADD-C 1
2 STO 10
3 JMP 0
4 HLT
...
10 0
  • Set PC to 0
  • Select Integers as the format for displaying the contents of the memory
  • Run the program.






Keep on observing the program!






  • What is the behavior of the program?
  • What do we call such a program? (Check with your instructor or the TA if you have figured out the right answer.)
  • You may find the Stop button useful for this exercise!
  • You will have figured out that the JMP instruction stands for JUMP, and forces the processor to jump back to a particular address in memory. In this case it tells the processor JUMP BACK TO ADDRESS 0.
  • How does the processor actually go back to Address 0?

Part 7: Exercise #2

  • Modify the above program so that the number in Memory Address 10 is 1 at the beginning, then 2, then 4, then 8, then 16, then 32, etc...
  • In case you were wondering what other instructions are available, you can find a list here