Discussion

1
Schedule
2
Pres. Faust Ensign Aug 2007

• Being single does not mean you have to put off
  being happy. As President Harold B. Lee
  (18991973) once said Happiness does not depend
  on what happens outside of you, but on what
  happens inside of you. It is measured by the
  spirit with which you meet the problems of life.
  
• Lastly, my advice to those of you who are single
  is to pray often because our Heavenly Father, who
  knows you best of all, knows your talents and
  strengths as well as your weaknesses. He has
  placed you here on the earth at this time to
  develop and refine these characteristics. I
  promise you He will help you. He is aware of your
  needs, and by and by those promised blessings of
  companionship will come to you.

3
Final Exam

• Testing Center
• Available during Finals Week (15 16 Aug)
• NO MAKEUP for missed exam!!!
• Scratch paper probably a good idea
• 96 Questions 4 or 5 per chapter
• Bonus Point for doing online evaluations
• 8 additional questions for BYU accreditation that
  DO NOT COUNT against your score BUT are bonus
  points

4
Chapters 16 19 Review

• 1. What characters are considered white space
  when reading input?
• 2. What is the difference between the scanf,
  sscanf, and fscanf functions?
• 3. What does the (r) mode do in the fopen
  function?
• 4. In which C library does one find the getc
  function?
• 5. What are the and -- operators used for?

5
Chapters 16 19 Review

• 6. How big is the activation record of function
  for the main function (in words, does NOT include
  space for saving registers R0-R4)?
• 7. What is an equivalent expression to xyz9?
• 8. What are valid prototypes for the integer
  factorial function?
• 9. What does X X evaluate as?
• 10. How are the elements of an array stored in
  memory?
• 11. List the different ways to store the value
  100 in the third element of data .

6
Just a few
a)      b)      c)      d)     
7
Lots of C
includeltstdio.hgt int main() int i int
a for (i 1 i lt 4 i) a a
i   printf("\nd", a)
(1) include ltstdio.hgt (2) (3) int
main() (4) (5) int x 2, y 7, z
1 (6) (7) if (10 gt y gt 5) (8) do (9) printf
("d", x) (10) while (x lt 4 ) (11) else if
(z) (12) do (13) printf("d",
y) (14) while ((y--) 2) (15) else (16) wh
ile (x ! 0) (17) printf("d",
x) (18) x (19) (20)
int variable / global /int main()
printf("\nd", variable) variable 5
int variable 9
variable 7 printf("\nd",
variable) printf("\nd", variable)
8
Lots of LC-3
.ORIG x30000 JSR FOO1 HALT2 FOO
JSR BAR3 RET4 BAR RET .END
.ORIG x30001 JSR THERE2 BR DONE3 THERE LEA
R0,PROMPT4 PUTS 5 RET6 DONE BR DONE7 PROMPT
.STRINGZ "Here is the promptgt "
.ORIG x30001 LDI R6,ADDR12 HALT3
ADDR1 .FILL x30034 ADDR2 .FILL x30045
ADDR3 .FILL xACED .END
.ORIG x30001 LEA R7,THERE2 ADD R7,R7,13 L
DR R0,R7,14 RET5 THERE BR HERE6
BR DONE7 HERE BR HERE8 DONE BR DONE
0x4400 LD R1,BOGUS0x4401...0x4480 BOGUS .Fill
SECRET...0x5000 SECRET .Fill 0x1234
9
Final Review

• Chapter 1 Welcome Aboard
• What is a Turing Machine?
• How do we solve a problem using a computer?
• What are the tradeoffs in designing computer
  systems?
• Chapter 2 Bits, Data Types, and Operations
• What are data types?
• What is the difference between unsigned, signed,
  2s complement binary and hexadecimal numbers?
• How are the ASCII codes defined?

10
Final Review

• Chapter 3 Digital Logic Structures
• How do P and N type transistors relate to Boolean
  equations?
• What are sequential and combinational logic
  circuits?
• How do R-S latches, decoders, and multiplexors
  work?
• Chapter 4 The Von Neumann Model
• What was von Neumann model of computer
  processing?
• What are computer instructions and how do they
  correlate to computer word lengths?
• What is the difference between address space and
  addressability?

11
Final Review

• Chapter 5 The LC-3
• How does an assembler put together an assembly
  instruction?
• What are the differences between ST, STI, and
  STR instructions?
• Chapter 6 Programming
• How does one go about writing a computer program?
• What are the basic programming constructs found
  in a programming language?
• What programming constructs are similar?

12
Final Review

• Chapter 7 Assembly Language
• Describe what the various assembly directives do.
• Chapter 8 I/O
• What are I/O device registers and how are they
  used?
• What is an I/O address space?
• What is polling and how does it differ from
  interrupt processing?

13
Final Review

• Chapter 9 TRAP Routines and Subroutines
• What are the differences between a TRAP and a
  JSRR instruction?
• What is the purpose of system calls?
• 25. What is the difference between caller-save
  and callee-save functions.
• Chapter 10 And, Finally...The Stack
• What are the common stack operations and how do
  they work?
• How is the stack used in interrupt processing?

14
Final Review

• Chapter 11 Introduction to Programming in C
• What does a C preprocessor do? a C compiler? a
  linker?
• What is a function and which function is always
  present?
• Chapter 12 Variables and Operators
• What is scope and how is it applied to functions
  and variables?

15
Final Review

• Chapter 13 Control Structures
• Describe C control structures.
• How does the ternary operator work?
• Chapter 14 Functions
• How is an activation record formed?

16
Final Review

• Chapter 15 Testing and Debugging
• What is the difference between a missing brace
  and an un-initialized variable?
• How are source-level debuggers used?
• Chapter 16 Pointers and Arrays
• What is a pointer and what is its relationship to
  an array?
• How are arguments passed to a function?

17
Final Review

• Chapter 17 Recursion
• What happens to the activation records in a
  recursive function?
• Chapter 18 I/O in C
• What are the various modifiers in a printf
  function?
• How does scanf differ from printf?

18
Final Review

• Chapter 19 Data Structures
• How do you access elements in a struct?
• How are structs linked together?
• (True or False) I have completed the on-line
  course evaluation.
• ABET Evaluations DO NOT HURT YOUR SCORE!
  BONUS POINTS

19
More

• Boolean notation
• Multiplexers and decoders (input/output/select)
• Addressability
• LC-3 programs (instructions provided)
• 2s complement arithmetic
• Overflow
• Stacks
• Word length/size

20
And More

• Binary arithmetic
• RS Latch
• LC-3 addressing modes
• Pointers
• typedef structs
• printf options
• Bonus on-line course evaluation ABET questions