Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Configure port A for the lower 4 bits to be inputs and the upper 4 bits to be outputs. The program should chase a logic one from Pa4 -> Pa7, depending upon the condition of Pa0-Pa3 the speed of chase is increased.
Pa0 = 1 Slow Counter Pa1 = 1 Counter Pa2 = 1 Counter Pa3 = 1 Fast Counter If all Pa0, Pa1, Pa2, Pa3 = 0 wait The only major difference is the data direction i.e. this configures 4 input lines Pa0-Pa3 and 4 output lines Pa4-Pa7
Paddr Bit7 Bit6 Bit5 Bit4 Bit3 Bit2 Bit1 Bit0 1 1 1 1 0 0 0 0 The full program is shown below
name first padr equ $0000 paddr equ $0001 org $500 ldaa #$f0 staa paddr set up half in and half out loop0 ldaa #$10 staa padr send data jsr delay ldaa #$20 staa padr send data jsr delay ldaa #$40 staa padr send data jsr delay ldaa #$80 staa padr send data jsr delay jmp loop0 delay ldab padr ;get input from port a andb #$0f ;mask of lower nibble only
beq delay ;repeat till selected ldab padr ;get port a data again andb #$8 ; mask off bit 3 pa3 bne loop3 ;if select go to loop3 ldab padr ;get port a data again andb #$4 ; mask off bit 2 pa2 bne loop4 ;if select go to loop4 ldab padr ;get port a data again andb #$2 ; mask off bit 1 pa1 bne loop5 ;if select go to loop5 ldx #$ffff ;assume pa0 is pressed load up x with ffff jmp loop1 ;carry on loop2 ldx #$1 ;load up X with 1 fast jmp loop1 ;carry on loop3 ldx #$f ;load X with f jmp loop1 loop4 ldx #$ff ;load x with ff jmp loop1 loop5 ldx #$fff ;load x with fff slow loop1 ldab #$1f ;nested loop loop6 decb bne loop6 dex bne loop1 ;loop till zero rts ;return back to main end
Decision Trees: Visualize you only ever do four things at the weekend such as go shopping or watch a movie or play tennis and just stay in. In such case what you do depends on
Differentiate between non-relocatable self relocatable programs. A non-relocatable program is one which cannot be executed in any memory area other than the area starting at
Linked list means node which is linked each other with a line. It means that every node is connected with another one. Every node of the list hold the reference of the next node.
Bitwise-Inclusive-OR Operator: inclusive-OR-expression : exclusive-OR-expression inclusive-OR-expression | exclusive-OR-expression The bitwise-inclusive-OR operator
In scalar processors just one instruction is implemented per cycle which means just one instruction is issued for each cycle and only that one instruction is completed however the
When the get cursor command used in interactive lists? If the hidden information is not enough to uniquely recognize the selected line, the command GET CURSOR is used. The GET
Objectives of object oriented analysis After going through this unit, you should be able to: define the concepts of the objects in the system; express desired syste
Floating point Arithmetic pipelines Floating point computations are the finest candidates for pipelining. Take the instance of addition of two floating point numbers. Following
Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have
i) The width of the sorting + merging circuit is equivalent to maximum number of devices needed in a phase is O(n/2). As in the above diagram maximum number of devices for a given
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd