Consider a computer with byte address memory, organized in 32-bit words according to the large-end scheme. The program reads the ASCII characters entered from the keyboard and saves them in sequential byte locations starting at location 1000. Show the contents of the two memory words at locations 1000 and 1004 after entering the name "johnson".
Simply convert each letter to hex using a convenient ASCII table and add them to memory one by one. It easily looks like great ASCII graphics:
+------+--+--+--+--+ |0x1000|6A|6F|68|6E| +------+--+--+--+--+
, .
, endianes (, ASCII). Endianes , . , , , . , 3 735 928 559 ( 0xdeadbeef ) 32- (, int) 1000:
: 1000 1001 1002 1004BE: de ad be efLE: ef be ad de
, :
1000: 0x6a6f686e 1004: 0x736f6e00
' 7 , , (00) .
Source: https://habr.com/ru/post/1719969/More articles:How can I make Modal Popup Extender Modal? (Disable background) - ajaxNotifyIcon events do not fire - c #Popup / New Window + Redirect_to + Rails - ruby-on-railsAutoHeight IFrame - jqueryInsert element - javascriptCustom form inline form - djangoAutomate update creation - eclipseWhere can I find a good Silverlight application XAML templates and themes? - templatesAre there any big names in the cloud? - google-app-enginehttps://translate.googleusercontent.com/translate_c?depth=1&pto=aue&rurl=translate.google.com&sl=ru&sp=nmt4&tl=en&u=https://fooobar.com/questions/1719974/sending-keystrokes-to-control-in-net&usg=ALkJrhhh_pnEt2WOgUN39NRJZ75MTMLg6QAll Articles