MOV ? , BL AND ? , ? MOV ? , ? SHR ? , ? ? ? , ?
Note :
Push AX Push BX Pop AX Pop BX Push AX
mov cx, 8000h CNT : mov [si], cx inc si loop CNT
code segment __ ........... | size = 0023h code ends __| data segment COMBINE_TYPE __ table dw 10 dup(?) | size = 0008h data ends __|In the .EXE file generated by linker, code segment is placed before the data segment. The program is loaded into memory at 009E3h. What will be the value of "SEG table" and "OFFSET table", when
bit no. 15-12 -- thousand's place 11-8 -- hundred's place 7-4 -- ten's place 3-0 -- unity's place
Note :
MOV CX, ?? ??? RCL AL bit_send : OUT DPORT, AL CALL DELAY ; to cause appropriate data transfer rate ??? AL, 1 ??? LOOP bit_send
switch (j) { case 1 : func1 (); break; case 2 : func2 (); break; case 3 : func3 (); break; case 5 : func5 (); break; case 6 : func6 (); break; } after_switch : ....... some other C code ....Comment on your approach as compared to one where we can implement the same thing using a no. of explicit jump and comparison instructions.
Write an assembly language program to implement recursive/non-recursive version of Quicksort.