GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Kostenlos registrieren

Karteikarten

Ohne Titel

Abbey Bancroft CpE 3110 undergraduate Englisch 58 Karten

Karten in diesem Stapel (58)

  1. 1Active part of computer, following the instructions of the programs, adding numbers, testing numbers, controlling other components, and so onCPU
  2. 2Approach to the design of hardware or software. The model consists of hierarchical structure,with each lower layer hiding details from the level above.Abstraction
  3. 3Binary digitbit
  4. 4Collection of implementations of the same instruction set architectureComputer family
  5. 5Component of the computer where all running program and associated data resideMemory
  6. 6Component of the computer that performs arithmetic operationsData Path
  7. 7Component of the computer that tells the data-path, memory, and I/O devices what to doaccording to the instructions of the program.Control
  8. 8Computer designed for use by an individualdesktop or PC
  9. 9Computer inside another device used for running one predefined application or collection ofsoftwareEmbedded System
  10. 10Computer used for running larger programs for multiple users often simultaneously and typicallyaccessed only by a network.Server
  11. 11High performance machineSuper Computer
  12. 12Integrated circuit commonly used to build main memoryDRAM
  13. 13Microscopic flaw in a waferDefect
  14. 14Percentage of good dies from the total number of dies on a waferYield
  15. 15Program that converts a symbolic version of an instruction into the binary code.Assembler
  16. 16Program that manages the resources of a computerOperating System
  17. 17Program that translates from high-level notation to assembly language.Compiler
  18. 18How many kilobytes are in a megabyte of memory?There are 2^10 kilobytes in 1 megabyte
  19. 19How many megabytes are in a gigabytememory?There are 2^10 megabytes in 1 gigabyte
  20. 20Does the main memory size in the system affect the speed of the operation, that is, excution of the programs, in a considerable way? How and why?Yes, in general, when the program needs a certain amount of memory to run, and the available memory is less than that amount; the program is partially brought into available storage as needed and stored in the available memory. This injects some overhead. On the other hand, if the available memory is less than a certain critical size then the program may not even execute.
  21. 21What evolutionary compulsion drove the invention of high-level languages? With the high-level languages available, what is the relevance of low-level languages today?As the computers began to be mass produced at cheaper cost, they were used for more complex applications than just to interact with a few I/O devices. This led to the development of complex software. As the length of the programs increased it became too tedious to write them in the low-level languages without errors. Along with the development of complex programming structured software another important evolution of computers is in small, embedded, mobile, remotely operated computers doing some very specialized jobs. These are running on very low power with extreme restrictions on memory and processing power
  22. 22Is this a valid statement: T1: MAR <- MAR, MAR <- 0no, dependent micro-operations cannot be done simultaneously
  23. 23Is this a valid statement: yT: R1 <- R2, R1 <- R3no, dependent micro-operations cannot be done simultaneously
  24. 24Is this a valid statement: T2: R1 <- R2, R3 <- R2, R1 <- R4no, dependent micro-operations cannot be done simultaneously
  25. 25Is this a valid statement: T1: PC <-MAR, PC <- PC + 1no, dependent micro-operations cannot be done simultaneously
  26. 26Is this a valid statement: T2: R1 <- R2, R3 <- R2yes, micro-operations are independent
  27. 27A serial computer employs 32-bit registers and clock pulses at a rate of one million per second.What is the bit time and the word time of the computer?Bit time = 1 micro-second, Word time = 32 micro-seconds
  28. 28Show that the statement A ⇐ A + A symbolizes a shift-left micro-operation.A <- A+A = 2A; Example: A = 00000101 = 5, After left-shift value of A = 00001010 = 10
  29. 29Show the representation of +31 in an 8-bit register. Divide and multiply this number by 2 and show how it can be done by means of arithmetic shift micro-operations31 in 8-bit register 00011111, Multiplication by 2 can be done by left shift operation:
    value after left shift is 00111110 = +62, Division by 2 can be done by right shift operation:
    value after right shift is 00001111 = +15
  30. 30Show the representation of -31 in an 8-bit register when in signed magnitude format. Divide and multiply this number by 2 and show how it can be done by means of arithmetic shift micro-operations-31 in signed magnitude format 10011111, Multiplying by 2 by left shift operation: 10111110 = -62,
    Dividing by 2 using a right shift operation 10001111 = -15
  31. 31Show the representation of -31 in an 8-bit register when in 1's complement format. Divide and multiply this number by 2 and show how it can be done by means of arithmetic shift micro-operations-31 in 1's compliment format 11100000, Multiplication by 2 using a left shift operator: 11000001 (added digit is 1)
    Division by 2 using a right shift operator: 11110000 (added digit is 1)
  32. 32Show the representation of -31 in an 8-bit register when in 2's complement format. Divide and multiply this number by 2 and show how it can be done by means of arithmetic shift micro-operations-31 in 2's compliment representation: 11100001, Multiplication by 2 using a left shift operator: 11000010
    Division by 2 using a right shift operator: 11110000 (added digit is 1)
  33. 33Perform the logic AND with the two numbers 11111100 and 010101011010100
  34. 34Perform the logic OR with the two numbers 11111100 and 01010101.11111101
  35. 35Perform the logic XOR with the two numbers 11111100 and 01010101.10101001
  36. 36Convert (10110100.00101)2 to (?)4 using the base 2^k technique(2310.022)4
  37. 37Convert (AB143)16 to (?)4 using the base 2^k technique(2223011003)4
  38. 38Convert (2347.45)8 to (?)16 using the base 2^k technique(4E7.94)16
  39. 39Convert (110111110.010000011)2 to (?)16 using the base 2^k technique(1 B E.4 1 8)16
  40. 40Convert (2 5 7 4)9 to (?)3(02122111)3
  41. 41An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Logical shift right from the initial value given above.111101
  42. 42An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Logical shift left from the initial value given above.11110110
  43. 43An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Arithmetic shift right from the initial value given above.111101
  44. 44An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Arithmetic shift left from the initial value given above.11110110
  45. 45An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Rotate right from the initial value given above.10111101
  46. 46An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Rotate left from the initial value given above.11110110
  47. 47An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Rotate right through carry from the initial value given above.10111101
  48. 48An 8-bit register contains the value 01111011 and the carry bit (C) isequal to 1. Perform Rotate left through carry from the initial value given above.11110111
  49. 49An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Logical shift right from the initial value given above.1100011
  50. 50An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Logical shift left from the initial value given above.10001110
  51. 51An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Arithmetic shift right from the initial value given above.(signed magnitude): 10100011
    (1s compliment): 11100011
    (2s compliment): 11100011
  52. 52An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Arithmetic shift left from the initial value given above.(signed magnitude): 10001110
    (1s compliment): 10001111
    (2s compliment): 10001110
  53. 53An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform rotate right from the initial value given above.11100011
  54. 54An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform rotate left from the initial value given above.10001111
  55. 55An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Rotate right through carry from the initial value given above.1100011
  56. 56An 8-bit register contains the value 11000111 and the carry bit (C) isequal to 0. Perform Rotate right through left from the initial value given above.10001110
  57. 57Design a 4-bit serial binary adder using three 4-bit shift registers, one full adder, and a D flip-flop. Two unsigned numbers are stored in two of the shift registers, A and B. Bits are added one pair at a time sequentially starting with the least significant bits. The carry out of the full adder is transferred to the D flip-flop in which the output is used as an input carry for the next pair of bits. The sum bit from the S output of the full adder is transferred into the third shift register CGood luck
  58. 58Repeat Problem 4.24 using only two 4-bit registers by shifting the sum into A while the bits of A are shifted out.good luck pt 2

Informationen

Beschreibung
undergraduate CpE 3110 (Quiz 1) Karteikarten am Ohne Titel, erstellt von Abbey Bancroft am 30/01/2024.
Erstellt von
Abbey Bancroft · Jan 2024
Aktualisiert
30 Jan 2024
Aufrufe
4
Bewertung

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck