logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Write a program in PLP assembly that repeatedly reads the value of the switches

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Learning Objectives:

Use PLP branch instructions

Read from a memory mapped I/O device

 

The Task:

Write a program in PLP assembly that repeatedly reads the value of the switches (address: 0xf0100000) and displays a pattern on the LED array based on what switches. Each time the switch value is read, the pattern should be displayed (regardless of whether the switch value has changed or not since the last time it was read). The table below indicates the pattern that should be displayed for each possible switch setting:

 

Switch

Number Hexadecimal

Switch Value Binary

Switch Value Decimal

Switch Value LED Pattern

0 0x00000001 0b00000001 1 Turn on LEDs 0, 1, 2, and 3, then set all 8

LEDs to off

1 0x00000002 0b00000010 2 Turn on LEDs 4, 5, 6 and 7, then set all 8

LEDs to off

2 0x00000004 0b00000100 4 Create a scrolling pattern that moves from right to left starting with LED 1 and skipping every other LED. Only one LED should be on at any given time (i.e., LED 1, then LED 3, then LED 5, then LED 7) and the pattern should end with all LEDs

off.

Other Other Other Other All LEDs off

 

Hint: Logical shifts are not required to complete this project, but they can be used to make your program shorter and more readable than hard coding every value to be written to the LEDs. Shifts can also be useful to generate the value that you compare with the value of the switches.

 

Deliverables:

1. Take the Project 2 Pre Quiz (2 points)

2. Submit your program on Canvas with the format: Firstname_Lastname_project2.plp (16 points)

3. Take the Project 2 Post Quiz (2 points)

 

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

500 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

582 Answers

Hire Me
expert
Husnain SaeedComputer science

999 Answers

Hire Me
expert
Atharva PatilComputer science

505 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30