Help me choose

Posts5

How do we guarantee confidentiality and integrity of message over the network? (ft. symmetric key, public key, hash, digital signature, certification authority) Network is always vulnerable to attacks. In particular, the existence of packet sniffing means that whatever is being transferred across the internet can be read, bit by bit. So rather than denying the potential for leaking the packets, network engineers have come up with several very robust, mathematical solutions that even if you know what the bits that are being transferred are, you cannot de.. 2021. 9. 29.
How is IP address allocated to a host/router? What is a subnet? Network layer deals with transmission of network-level packets called IP datagrams. Network layer is present on every router and end systems (hosts). Network layer is not concerned with the abstracted, end-to-end communication between two hosts (as in transport layer). It's concerned with the communication that happens between every pair of routers and hosts. That was abstract enough. Here's whe.. 2021. 9. 25.
Determining control signals for a cycle of instruction Cheatsheet - Singlecycle - Multicycle Properly solving it Look at the question above. It's quite intimidating at the start because it feels very difficult to parse through. Control signals are referring to the orange lines in the diagram below. The red dotted lines are drawn so that it's clear what needs to be considered in each cycle. The territory contained within that red dotted line is what .. 2021. 9. 22.
Some facts and conventions about memory (ft. little endian, stack frame) 1. Little endian vs Big Endian CPU can be little-endian, or big-endian. Little Endian Little endian means MSB (most significant byte) is in higher memory address. Consequence of little endian 1: Saving 0x0000 8015 to 0x0000 3200 The instruction populates 0x8015 to bottom 16 bits of $12. So we are saving $12 = 0x0000 8015. We are saving it to an address (512($10) = 512+ 0x3000 = 0x200 + 0x3000 = .. 2021. 9. 22.
MIPS useful snippets Loops Loop 1 (increment) for(int i = 12; i12; i--){ // do A } // do B addi$t0, $0, 34 addi$t1, $0, 12 L1: beq$t0, $t1, exit // do A addi$t0, $t0, -1 jL1 exit: // do B Loop 3 (while loop blocking) while(a == b){ // do A } // do B L1: bne$t0, $t1, exit // do A exit: // do B Loop 4: execute body `counter` times # while loop body executed 100 times (counter) i = 0; j = 0; counter = 100; do{ i += 4; .. 2021. 9. 19.

티스토리툴바