Exam-Embedded Systems- Exam Paper 1-Electrical and Computer Engineering, Exams for Embedded Systems. University of Alabama (AL)
cristelle
cristelle2 March 2012

Exam-Embedded Systems- Exam Paper 1-Electrical and Computer Engineering, Exams for Embedded Systems. University of Alabama (AL)

PDF (8 KB)
1 page
11Number of download
1000+Number of visits
Description
Embedded Systems Software Architectures, C Programming Language, Embedded Systems Software Design, NIOS II System, Main Memory, FIFO, Block Hit Ratio, Embedded Systems, Exam, Dr Jeff Jackson, Department of Electrical and...
20 points
Download points needed to download
this document
Download the document
Preview1 page / 1
Download the document
Microsoft Word - Exam1 (example)

ECE486/586 Sample questions for Exam #1 The exam will be closed book/notes. 1. List three examples of embedded systems software architectures.

2. Give three strengths and three weaknesses of the C programming language. Which of these are particularly applicable to embedded systems software design?

3. Give a block diagram of a typical NIOS II system, showing all major components.

4. What is the significance of a NIOS II BSP and how is it related to both the NIOS II hardware and the user application to be developed?

5. Show the C code necessary for creating an alarm that executes once every 10 seconds on an appropriately configured NIOS II system.

6. Assume a fully associative cache memory with four blocks is present in a memory hierarchy. Assume execution of a program Q generates a main memory block reference stream given by:

Time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Block 1 2 3 2 4 1 5 6 3 2 4 5 1 2 6

a. Show the content of the cache at each time step assuming a FIFO replacement policy. Indicate with an ‘*’ which

block would be replaced at each time step if block replacement is necessary. Indicate which block accesses represent cache block hits.

b. Show the content of the cache at each time step assuming an LRU replacement policy. Indicate with an ‘*’ which block would be replaced at each time step if block replacement is necessary. Indicate which block accesses represent cache block hits.

c. Show the content of the cache at each time step assuming an OPT replacement policy. Indicate with an ‘*’ which block would be replaced at each time step if block replacement is necessary. Indicate which block accesses represent cache block hits. If there is more than one suitable block to replace using the OPT policy, resort to the FIFO policy to determine the block to replace.

d. What is the block hit ratio for each replacement policy?

e. If n*=1000, what is the estimated word hit ratio for each replacement policy?

7. Discuss the three basic strategies for I/O software in embedded systems.

comments (0)

no comments were posted

be the one to write the first!

Download the document