Week 1- Topic 1 - Intro to Computer Hardware - Part 1-V2 PDF

CSC111/CSCI101/CBIO101 Computer and Information Skills Orientation Session Fall2024   LECTURERS  TOPICS COVERED  SUGGESTED Course Outline REFERENCES  GRADES STRUCTURE...

CSC111/CSCI101/CBIO101 Computer and Information Skills Orientation Session Fall2024   LECTURERS  TOPICS COVERED  SUGGESTED Course Outline REFERENCES  GRADES STRUCTURE  COURSE SCHEDULE  Course Lecturers Dr. Noha Gamal Dr. Samar Nour UB1 -203 (Visiting) [email protected] [email protected] Dr. Hadeer Hosny Dr. Sherine Taie (Visiting) (Visiting) [email protected]  4 Topics Covered Hardware Network Programming & Security Softwar Databases AI e Multimedia  5 Suggested References Computer Science, An Overview 12th edition J. Glenn Brookshear, Dennis Brylow New Perspectives on Computer Concepts 2014 Parsons|Oja  6 Grades Structure # Item Grade 1 Lecture Att. (10) 5 2 Tutorial tasks (10) 15 3 Lab Tasks (10) 15 4 Projects (2) 25 + 5 Bonus 5 Quizzes (3) 5 6 Midterm (1) 10 7 Final (1) 25 The grades weights are subject to adjustment as per the overall groups performance. Grade Petition Policy: Any grade can be discussed within only one week of its announcement. Cheating Policy: any student has a confirmed cheating case, will get 0 in the first cheated task, deprived 5 marks of his classwork in any following cheated task (if any). If the student cheated in an exam he will get a zero in this exam and his case will be subject to more investigations to follow a suitable punishments policy.  7 Course Calendar Curriculum and practical content distribution through out semester weeks.  Calendar and Syllabus Date Lecture Tut Lab Presentation Skills (Soft Skills) + No Lab 29-Sep Number Systems+ Logic Gates Computer Hardware Logic Gates Presentation on a Hardware 6-Oct Intro to Programming (Algorithms) (High level) - Numbering Systems component Flowchart – Pseudocode + web 1+ Simulation (Proteus- Tinkercad) How the Computer Works (Program Execution announce project 1 + Number System Tasks 13-Oct Cycle) (Deep Level) Flowchart, Pseudocode + web1 Web2 + (Q1) 20-Oct Data Manipulation and Data Storage Tasks Project 1 Support (Show work Web2 Tasks 27-Oct Operating Systems (Intermed Level) graded) OS (Linux - Windows) - Git Project 1 Discussions 3-Nov Intro to Software Engineering 10-Nov Midterm Week 17-Nov Intro to Databases No Tut No Lab 24-Nov DB in Action (SQL) DB 1 Linux, Git Tasks 1-Dec Intro to Networking DB 2 DB1 Tasks IP - Packet - Ports - Topology - DB2 Tasks 8-Dec Intro to AI Packet tracer (Q2) 15-Dec Intro to Information Security Prompt Engineering Packet Tracer Tasks Project 2 Support (Show work GPTs Tasks 22-Dec Intro to Multimedia graded) (Q3) 29-Dec Revision No Tutorial Project 2 Discussions 5-Jan Study Week 10-Jan 24-Jan Final Exam © 2015 Pearson Education Limited 2015 Grade Submission  Chapter 1: Computer Hardware and Data Representation © 2015 Pearson Education Limited 2015 Chapter 1: Computer Hardware and Data Representation What are Computers? Digital Vs. Analog Different Data Representations Number Systems Arithmetic/Logic Operations Boolean Operations Gates © 2015 Pearson Education Limited 2015 1-10  11 What are Computers?  A Computer is a programmable, digital device  2 Digits Only  Hardware and Software CSCE101-Computer and Information Skills THE WORLD OF COMPUTERS HARDWARE & SOFTWARE  14 Digital vs Analog Analog Digital Continuous Discrete CSCE101-Computer and Information Skills  15 Different Data Representations Bit Patterns are used to represent information, 1 Bit: Bi nary Digi t (0 or 1) Numbers, Text characters, Images, Sound, and others  ‘a’ = 01100001 (Ascii Code)  34 = 100010  Image (colors to Number) 0  Audio (dB to Numbers)  Video (Color/frame to Numbers) CSCE101-Computer and Information Skills  Number Systems © 2015 Pearson Education Limited 2015 0-16  The Binary System The traditional decimal system is based on powers of ten. The Binary system is based on powers of two. © 2015 Pearson Education Limited 2015 1-17  Figure 1.13 The base ten and binary systems © 2015 Pearson Education Limited 2015 1-18 2.0 Binary Numbers Used to represent the voltage levels of a digital circuit. Only two voltage levels present in a digital circuit, logic High and logic Low. The high voltage is +5V and the low voltage is +0V. The binary numbers represent the logic low as a 0 and the logic high as a 1.  2.1 Binary Numbers Example A calculator is an example of a digital system. Decimal numbers are pressed on the keypad, where the input values are converted to binary for processing, then converts the answers to a decimal value before displaying them. Number conversion occurs extensively in a digital circuit. In this chapter, you will learn numbers systems and codes used in digital circuit. You will also learn how to perform conversion from one number system to another.  2.2 Decimal  Binary Conversion A decimal number can be converted to a binary number by successively dividing the number by 2 as follows: Note that: The last remainder appears in the division process becomes the most significant bit (MSB). The first remainder becomes the least significant bit (LSB).  Figure 1.15 An algorithm for finding the binary representation of a positive integer © 2015 Pearson Education Limited 2015 1-22 2.3 Binary  Decimal Conversion A binary number is converted to a decimal number by summing together the weights of various positions in the binary number which contain a 1. For example, 10101112 = 8710.  Figure 1.14 Decoding the binary representation 100101 © 2015 Pearson Education Limited 2015 1-24  Figure 1.17 The binary addition facts © 2015 Pearson Education Limited 2015 1-25 Other Types of Number System  Other Types of Number Systems Type Base Numbers/Symbols Decimal 10 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Binary 2 0, 1 Octal 8 0, 1, 2, 3, 4, 5, 6, 7 Hexadecimal 16 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F 3.0 Decimal  Octal Conversion A decimal number can be converted to an octal number by successively dividing the number by 8 as follows: 266 ÷ 8 = 33 remainder 2 LSD (right-most digit) 33 ÷ 8 = 4 remainder 1 4 ÷ 8 = 0 remainder 4 MSD (left-most digit). Therefore 26610 = 4128 3.1 Octal  Decimal Conversion To convert an octal number to a decimal number, multiply each octal value by the weight of the digit and sum the results. For example, 4128 = 26610. 3.2 Octal  Binary Representation Each octal digit can be represented by a 3-bit binary number as shown below:  3.2 Octal Binary Conversion  Conversion from octal to binary is very straightforward. Each octal digit is replaced by 3-bit binary number. For example, 4728 = 100 111 0102.  A binary number is converted into an octal number by taking groups of 3 bits, starting from LSB, and replacing them with an octal digit. For example, 11 010 1102 = 3268. 4.0 Hexadecimal Number The hexadecimal number uses base 16. It uses the digits 0 through 9 plus the letters A, B, C, D, E and F. The letter A stands for decimal 10, B for 11, C for 12, D for 13, E for 14 and F for 15. 4.1 Hexadecimal Number 4.2 Decimal  Hexadecimal Conversion A decimal number can be converted to hex number by successively dividing the number by 16 as follows: 4.3 Hexadecimal  Decimal Conversion To convert a hex number to a decimal number, multiply each hex value by the weight of the digit and sum the results. For example, 1A716 = 42310. 162 161 160  4.4 Hexadecimal Binary Conversion Each hex digit can be represented by a 4-bit binary number as shown above. Conversion from hex to binary is very straightforward. Each hex digit is replaced by 4-bit binary number.  A binary number is converted into an octal number by taking groups of 4 bits, starting from LSB, and replacing them with a hex digit. For example, 110101102 = 3268.  Arithmetic/Logic Operations © 2015 Pearson Education Limited 2015 2-37  Arithmetic/Logic Operations Logic: AND, OR, XOR Rotate and Shift: circular shift, logical shift, arithmetic shift Arithmetic: add, subtract, multiply, divide © 2015 Pearson Education Limited 2015 2-38  Boolean Operations Boolean Operation: An operation that manipulates one or more true/false values Specific operations – AND – OR – XOR (exclusive or) – NOT © 2015 Pearson Education Limited 2015 1-39  Figure 1.1 The possible input and output values of Boolean operations AND, OR, and XOR (exclusive or) © 2015 Pearson Education Limited 2015 1-40  Gates Gate: A device that computes a Boolean operation – Provide the building blocks from which computers are constructed © 2015 Pearson Education Limited 2015 1-41  Figure 1.2 A pictorial representation of AND, OR, XOR, and NOT gates as well as their input and output values © 2015 Pearson Education Limited 2015 1-42  End of Lecture © 2015 Pearson Education Limited 2015