Prepare for your exams
Get points
Guidelines and tips
Sell on Docsity
Docsity AI

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips

Sell on Docsity

Docsity AI

Log in Sign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents

20 Points

For each uploaded document

Answer questions

5 Points

For each given answer (max 1 per day)

All the ways to get free points

Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Assembly Language - Machine Structures - Exams, Exams of Structural Analysis

Main points of this exam paper are: Assembly Language, Section Meeting, Meeting Time, Discussion Section, Assembly Language, Legal Assembly, Checkmark, Machine, First Instruction, Tal Program

Typology: Exams

2012/2013

Uploaded on 04/02/2013

shalabh_li43y 🇮🇳

4.5

(18)

88 documents

1 / 5

This page cannot be seen from the preview

Don't miss anything!

CS61c-Midterm 1, Professor Fateman: 9/29/98

Your family name ______________________ Your given name______________

Your Student ID number _______________ login: cs61c_______

Please circle the last two letters of your login name.

b c d e f g h i j k l m n a o p q r s t u v w x y z

The reason we asked this was so we would have some recourse if we could not read

your

handwriting. A surprising number of people left this out, including people whose login

was unclear to us, confusing g and q, u and v, l and e, a and o.

Discussion section meeting time___________ TA’s name _________________

Look at the edge of your seat. Write your row and number. Your row number may not be

visible

from where you sit, so we will help you later. Row_________ Seat _______

This booklet contains 6 numbered pages including the cover page, plus 3 pages of

excerpts from

appendix B and C of Goodman and Miller. Put all answers on these pages, please; don’t

hand in

stray pieces of paper. The exam contains 7 substantive questions, plus question 0 and the

box

immediately below.

I certify that my answers to this exam are all my own work, and that I have not

discussed the exam questions or answers with anyone prior to taking this exam. If I

am taking this exam early, I certify that I shall not discuss the exam questions or

answers with anyone until after the scheduled exam time.

Signature _____________________

Question Max Points Your Points

0 1

1 17

2 5

3 6

4 6

5 5

6 5

7 15

8 20

Total 80

Partial preview of the text

Download Assembly Language - Machine Structures - Exams and more Exams Structural Analysis in PDF only on Docsity!

CS61c-Midterm 1, Professor Fateman: 9/29/

Your family name ________ Your given name

Your Student ID number _________ login: cs61c _

Please circle the last two letters of your login name.

b c d e f g h i j k l m n a o p q r s t u v w x y z

The reason we asked this was so we would have some recourse if we could not read

your

handwriting. A surprising number of people left this out, including people whose login

was unclear to us, confusing g and q, u and v, l and e, a and o.

Discussion section meeting time_ TA’s name _______

Look at the edge of your seat. Write your row and number. Your row number may not be

visible

from where you sit, so we will help you later. Row___ Seat _

This booklet contains 6 numbered pages including the cover page, plus 3 pages of

excerpts from

appendix B and C of Goodman and Miller. Put all answers on these pages, please; don’t

hand in

stray pieces of paper. The exam contains 7 substantive questions, plus question 0 and the

box

immediately below.

I certify that my answers to this exam are all my own work, and that I have not

discussed the exam questions or answers with anyone prior to taking this exam. If I

am taking this exam early, I certify that I shall not discuss the exam questions or

answers with anyone until after the scheduled exam time.

Signature _____________________

Question Max Points Your Points 0 1 1 17 2 5 3 6 4 6 5 5 6 5 7 15 8 20 Total 80

Question 0 (1 point): Fill out the front page correctly and put your login correctly at the

top of

each of the following pages..

Question 1 (20 points): These questions pertain to the mostly meaningless "program" on

the

next page.

a. Place a check in the appropriate column to identify which of the MAL instructions

used below

must be changed to more than one machine instruction (that is, requires more than one

instruction when written in pure TAL). And write out their translation into TAL in the

space at the bottom of the page!

b. Certain of the commands are not legal assembly language. Identify them with a

checkmark as

well.

c. At a number of points in the execution of this program, the value in register 4 changes.

Place a

checkmark in the appropriate column when, after the indicated instruction completes,

register 4

has the number 5 in it.

You may assume that the machine you are executing the instructions on is an HP (big-

endian)

machine.

.data word5: .word 5 abc5: .byte ’a’, ’b’,’c’, zero: .word 0 .text __start: # (1a) (1b) (1c)

The main routine Check if 2 ops Check if it Check

if

in TAL is illegal

[$4]= main: lui $4, 0 1 -----------------|----------------|------

ori $4, 5 2 -----------------|----------------|------

lui $4, 0 3 -----------------|----------------|------

li $4, 0x50005 4 -----------------|----------------|------

la $4, word5 5 -----------------|----------------|------

lw $4, word5 6 -----------------|----------------|------

addi $4,$0,0 7 -----------------|----------------|------

Question 4 (6 points). What do the following expressions evaluate to in C? (Show your

work)

Question 5 (5 points). As we have discussed in lecture, one strategy in setting up register

usage is to have one register, a global pointer, GP point to the beginning of the data

segment of

your program. That way it is easy for all programs to refer to data like error message

strings

with simple offsets from that base register.

Instead of setting GP to the beginning(numerically lowest) address in the .data segment,

say

0x10000000, it may be useful to set it somewhere above

the lowest address in use, say to 0x10008000. Why?

Question 6 (5 points). On the MIPS, architecture, the only addresses that one can branch

to

are on full-word boundaries (have 2 0s at the end), and therefore all branch instructions

always

use the 16-bit immediate as an 18 bit signed field. Since one can only load words from a

full-word

location, why aren’t ALL the offsets in all the load and store instructions also multiplied

by 4?

Question 7 (15 points). Here is a simple program to compute a function of one

argument. It is

based on a program you have seen in the lab, but this time it is not recursive.

a. See if you can make it smaller by eliminating (crossing out) unnecessary lines of

assembler.

__start: li $a0,4 #f(4) jal f done

f: sub $sp,$sp,8 # adjust the stack for 2 items sw $ra,4($sp) # save the return address sw $a0,0($sp) # save the argument n addi $v0,$zero,1 # initialize answer

loop: slt $t0,$a0,2 # test for n < 2 beq $t0,$zero,L1 # if n>1, go to L addi $sp,$sp,8 # pop off 2 items off stack

jr $ra #return to after jal

L1: mul $v0,$a0,$v sub $a0,$a0,1 # n >=1; argument gets (n-1) j loop

Assembly Language - Machine Structures - Exams, Exams of Structural Analysis

Related documents

Partial preview of the text

Download Assembly Language - Machine Structures - Exams and more Exams Structural Analysis in PDF only on Docsity!

CS61c-Midterm 1, Professor Fateman: 9/29/

Your family name ______________________ Your given name ______________

Your Student ID number _______________ login: cs61c _______

Please circle the last two letters of your login name.

b c d e f g h i j k l m n a o p q r s t u v w x y z

b c d e f g h i j k l m n a o p q r s t u v w x y z

The reason we asked this was so we would have some recourse if we could not read

your

handwriting. A surprising number of people left this out, including people whose login

was unclear to us, confusing g and q, u and v, l and e, a and o.

Discussion section meeting time___________ TA’s name _________________

Look at the edge of your seat. Write your row and number. Your row number may not be

visible

from where you sit, so we will help you later. Row_________ Seat _______

This booklet contains 6 numbered pages including the cover page, plus 3 pages of

excerpts from

appendix B and C of Goodman and Miller. Put all answers on these pages, please; don’t

hand in

stray pieces of paper. The exam contains 7 substantive questions, plus question 0 and the

box

immediately below.

I certify that my answers to this exam are all my own work, and that I have not

discussed the exam questions or answers with anyone prior to taking this exam. If I

am taking this exam early, I certify that I shall not discuss the exam questions or

answers with anyone until after the scheduled exam time.

Signature _____________________

Question 0 (1 point): Fill out the front page correctly and put your login correctly at the

top of

each of the following pages..

Question 1 (20 points): These questions pertain to the mostly meaningless "program" on

the

next page.

a. Place a check in the appropriate column to identify which of the MAL instructions

used below

must be changed to more than one machine instruction (that is, requires more than one

instruction when written in pure TAL). And write out their translation into TAL in the

space at the bottom of the page!

b. Certain of the commands are not legal assembly language. Identify them with a

checkmark as

well.

c. At a number of points in the execution of this program, the value in register 4 changes.

Place a

checkmark in the appropriate column when, after the indicated instruction completes,

register 4

has the number 5 in it.

You may assume that the machine you are executing the instructions on is an HP (big-

endian)

machine.

The main routine Check if 2 ops Check if it Check

in TAL is illegal

ori $4, 5 2 -----------------|----------------|------

lui $4, 0 3 -----------------|----------------|------

li $4, 0x50005 4 -----------------|----------------|------

la $4, word5 5 -----------------|----------------|------

lw $4, word5 6 -----------------|----------------|------

Question 4 (6 points). What do the following expressions evaluate to in C? (Show your

work)

Question 5 (5 points). As we have discussed in lecture, one strategy in setting up register

usage is to have one register, a global pointer, GP point to the beginning of the data

segment of

your program. That way it is easy for all programs to refer to data like error message

strings

with simple offsets from that base register.

Instead of setting GP to the beginning(numerically lowest) address in the .data segment,

say

0x10000000, it may be useful to set it somewhere above

the lowest address in use, say to 0x10008000. Why?

Question 6 (5 points). On the MIPS, architecture, the only addresses that one can branch

to

are on full-word boundaries (have 2 0s at the end), and therefore all branch instructions

always

use the 16-bit immediate as an 18 bit signed field. Since one can only load words from a

full-word

location, why aren’t ALL the offsets in all the load and store instructions also multiplied

by 4?

Question 7 (15 points). Here is a simple program to compute a function of one

Your family name ________ Your given name

Your Student ID number _________ login: cs61c _

Discussion section meeting time_ TA’s name _______

from where you sit, so we will help you later. Row___ Seat _