Revision Lecture Intro to IT COSC1078 Introduction to Information Technology Extra Lecture Review James Harland

Revision LectureIntro to IT Introduction to IT 1 Introduction 2 Images 3 Audio 4 Video 5 Binary Representation WebTest 1, Assignment 1 6 Data Storage 7 Review/Machine Processing 8 Operating Systems WebLearn Test 1 9 Processes Assignment 2 10 Internet & Survey 11 Internet Security WebLearn Test 3 12 Future of ITAssignment 3, Peer and Self Assessment

Revision LectureIntro to IT Overview  Questions?  Mock Exam  Requested topics  Questions?

Revision LectureIntro to IT Intro to IT Schedule WeekLecture 1Lecture 2 12Future of IT 13Tuesday 19 th October Review Thursday 21 st October Mock Exam

Revision LectureIntro to IT Mock Exam  on Thursday 21 st October in  Bring your own paper, pens, etc.  Calculators and translation dictionaries allowed  Answers will be available from me when you leave Schedule:  1.00 Access to room  1.15 Reading time commences  1.30 Writing time commences  3.30 Exam concludes

Revision LectureIntro to IT Review Topics  Logic gates  Hexadecimal to/from binary conversions  Process vs. program  Floating point  Network layers  Encryption  Internet architecture  Machine cycle

Revision Lecture Intro to IT Hexadecimal … AF136DF738CA BCFE5C36A63B…

Revision Lecture Intro to IT Hexadecimal  Notation for binary numbers  More compact than  NOT decimal (0-9)  Base 16: = 1 x x C D A 1010 E B 1011 F 1111

Revision Lecture Intro to IT Excess Notation Bit patternValue  A different encoding of the numbers  “naive” bit pattern encodes 4 more than actual value  100 (looks like 4) encodes 0  101 (looks like 5) encodes 1  110 (looks like 6) encodes 2

Revision Lecture Intro to IT Floating Point sign bit Mantissa exponent 1 bit for sign 3 bits for exponent 4 bits for mantissa

Revision Lecture Intro to IT Floating Point : +ve shifted 111 (+3) places = : –ve shifted 001 (-3) places =  Mantissa: digit sequence (1 st digit always 1)  Exponent: where to put the.  This is generally given in ‘excess’ notation  Binary form of x 10 4

Revision Lecture Intro to IT Gates and circuits or and not

Revision Lecture Intro to IT Gates and circuits  No storage here  Results instantaneously available  Disappear when inputs change  How can a bit be `stored’?

Revision Lecture Intro to IT Memory via `Flip flops’ or and not

Revision Lecture Intro to IT Memory via `Flip flops’ or and not

Revision Lecture Intro to IT Memory via `Flip flops’  Can design other versions of flip-flops  Shows how circuits can be designed using AND, OR, NOT (NAND, NOR, XOR, …) in combinations (gates)  Hierarchy and abstraction  Shows how electric circuits can store values

Revision Lecture Intro to IT Fetch Decode Execute FETCH EXECUTEDECODE Machine cycle

Revision Lecture Intro to IT Two special registers Instruction register: holds current instruction Program counter: address of next instruction Fetch: Put instruction specified by program counter into instruction register Increment program counter by two Decode: Work out what to do Execute: Perform the instruction

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A0 AddressContents

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A0 FETCH 156C

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A2 FETCH 156C

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A2 DECODE 156C 6C 2B

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A2 EXEC 156C 6C 2B 2B5

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A2 FETCH 166D

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A4 FETCH 166D

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A4 DECODE 166D

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A4 EXEC 166D 6D FF FF6

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register A6 FETCH 5056

Revision Lecture Intro to IT Processing A0 15 A1 6C A2 16 A3 6D A4 50 A5 56 A6 30 A7 C0 A8 C0 A9 00 Program Counter Instruction Register …

Revision Lecture Intro to IT Processing Program Counter Instruction Register EXEC B258 B4

Revision Lecture Intro to IT Processing Program Counter Instruction Register EXEC B258 58

Revision Lecture Intro to IT Processing  Jump instructions change program counter  Can load any memory address into program counter (!!!)  Often use pipelining for efficiency  Fetch next instruction while executing  Processor doesn’t wait for fetch to complete  Can do more than one instruction …

Lecture 24: ReviewIntro to IT Processes

Revision Lecture Intro to IT Processes A program is a static set of instructions A processes is the execution of a program, which changes state over time.

Revision Lecture Intro to IT Processes Executing in Context Program Counter Instruction Register CC ROM RAM ProcessorMemory Disk 00 CC

Revision Lecture Intro to IT Processes Executing in Context Program Counter Instruction Register DD ROM RAM ProcessorMemory Disk 00 CC DD

Lecture 19: Internet: ImagesIntro to IT Internet Lisa? Hi Dad! Listen! Lisa? Hi Dad! Listen!

Revision Lecture Intro to IT Internet Structure Application Transport Network Link Network Link Mordor sucks! 2 dor1 Mor 3 suc4 ks! dor1 Mor 3 suc4 ks! Mordor sucks!

Revision Lecture Intro to IT Internet Structure 1 Mor 1 6 6

Revision Lecture Intro to IT Network Layer (Internet Protocol)  Real intelligence is in the network layer  Adds next destination to packet  Not complete list of addresses  Sends to next destination  Retrieves final destination packets for this node  Passes them to the transport layer  Routing tables can be updated when disconnections occur  Hop counts used to stop endless looping

Revision Lecture Intro to IT Transport layer  Transmission Control Protocol (TCP) often used  User Datagram Protocol (UDP) becoming more common  TCP Establishes connection first Send and wait for acknowledgement Reliable Can adjust flow control to avoid congestion Often best for (which is not real-time) Older

Revision Lecture Intro to IT Transport layer  UDP Doesn’t establish connection Just sends and forget Efficient No congestion adjustment Works well for DNS lookup Often used for Voice over Internet Protocol (VoIP) applications such as Skype

Revision Lecture Intro to IT Transmitting secrets Question: How do you share a secret with someone you have never met?

Revision Lecture Intro to IT Encryption “new password is bumblebee” “new password is bumblebee” Send Decrypt Encrypt

Revision Lecture Intro to IT Public Key Systems  Alice needs to know Bob's encryption key  Alice needs to know Charlie's encryption key  Alice needs to know David's encryption key...  Alice needs to know everyone's encryption key All encryption keys are made public All decryption keys are kept private

Conclusion  Come to the mock exam