boyan_k/ICS_Homeworks
boyan_k/ICS_Homeworks
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

made them look nicer

Browse Source
This commit is contained in:
Boyan 2022-11-04 18:40:12 +01:00
parent 14d9138e15
commit 4ba88e84e5
3 changed files with 42 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
1_Data_Storage.md
View File

@ -1,22 +1,22 @@
## How many bits are needed to represent 1024 different bit patterns? ### How many bits are needed to represent 1024 different bit patterns?
10.0 10.0
## How many errors in a single code pattern could be corrected when using an error-correcting code in which each code pattern is a Hamming distance of at least seven from any other code pattern? ### How many errors in a single code pattern could be corrected when using an error-correcting code in which each code pattern is a Hamming distance of at least seven from any other code pattern?
3, Three 3, Three
## A computer's main memory consists of numerous memory cells, each of which contains **(eight, 8)** Each memory cell is identified by a numeric value called the cell's**(memory address, address)**. ### A computer's main memory consists of numerous memory cells, each of which contains **(eight, 8)** Each memory cell is identified by a numeric value called the cell's**(memory address, address)**.
## If the patterns 101.11 and 1.011 represent values in binary notation, what is the binary representation of their sum? ### If the patterns 101.11 and 1.011 represent values in binary notation, what is the binary representation of their sum?
###111.001 ####111.001
## In which of the following addition problems (using two's complement notation) does an overflow error occur? ### In which of the following addition problems (using two's complement notation) does an overflow error occur?
0100 + 0100 0100 + 0100
## Represent the bit pattern 1011010010011111 in hexadecimal notation ### Represent the bit pattern 1011010010011111 in hexadecimal notation
B49F B49F
## The following is an error-correcting code in which any two patterns differ by a Hamming distance of at least three. Decode each of the following patterns: ### The following is an error-correcting code in which any two patterns differ by a Hamming distance of at least three. Decode each of the following patterns:
| Symbol | Representation | | Symbol | Representation |
|--------|----------------| |--------|----------------|
| A | 000000 | | A | 000000 |
@ -33,25 +33,25 @@ B49F
011000 - D 011000 - D
101101 - F 101101 - F
## What is the smallest negative integer that can be represented in a two's complement system in which each value is represented by eight bits? ### What is the smallest negative integer that can be represented in a two's complement system in which each value is represented by eight bits?
10000000, -128 (either is correct) 10000000, -128 (either is correct)
## Which of the following data storage systems provides the most efficient random access to individual data items? ### Which of the following data storage systems provides the most efficient random access to individual data items?
Main memory Main memory
## Which of the following is the binary representation of 4 5/8? ### Which of the following is the binary representation of 4 5/8?
100.101 100.101
## Which of the following representations in two's complement notation represents the largest value? ### Which of the following representations in two's complement notation represents the largest value?
00000010 00000010
## A7DF is the hexadecimal representation for what bit pattern? Put a single space between each group of 4 bits, for ease of reading ### A7DF is the hexadecimal representation for what bit pattern? Put a single space between each group of 4 bits, for ease of reading
1010 0111 1101 1111 1010 0111 1101 1111
## Which of the following best describes the NAND operation? ### Which of the following best describes the NAND operation?
An AND followed by a NOT An AND followed by a NOT
## What is the result of the following subtraction problem (using two's compliment notation)? 00001111 - 10101010 ### What is the result of the following subtraction problem (using two's compliment notation)? 00001111 - 10101010
01100101 01100101

28
2_Data_Manipulation.md
View File

@ -1,43 +1,43 @@
## A computer's main memory consists of numerous memory cells, each of which contains ........ bits. Each memory cell is identified by a numeric value called the cell's ........... . ### A computer's main memory consists of numerous memory cells, each of which contains ........ bits. Each memory cell is identified by a numeric value called the cell's ........... .
Eight. Eight.
Address. Address.
## In which of the following locations is information most readily available for manipulation by the CPU? ### In which of the following locations is information most readily available for manipulation by the CPU?
General-purpose registers General-purpose registers
## Which of the following instructions (as described in the language description table) places 00000000 in register A? ### Which of the following instructions (as described in the language description table) places 00000000 in register A?
2A00 2A00
## Which of the following is not contained in a CPU? ### Which of the following is not contained in a CPU?
Memory cell Memory cell
## Which step of the machine cycle examines the op-code of the next instruction to be executed? ### Which step of the machine cycle examines the op-code of the next instruction to be executed?
Decode Decode
## Author's note: Q6 on this quiz involves [Caesar cipher](https://en.wikipedia.org/wiki/Caesar_cipher), it is way too long to even try to memorize, but it's ez. ### Author's note: Q6 on this quiz involves [Caesar cipher](https://en.wikipedia.org/wiki/Caesar_cipher), it is way too long to even try to memorize, but it's ez.
Look it up Look it up
## Turn the string "The Answer" into binary using the ASCII table. Apply "01101001 00101110 00001010 01010010 00110101 00010111 01011110 00000011 00010010 00011101" to it using XOR. Look up the result in the ascii table. ### Turn the string "The Answer" into binary using the ASCII table. Apply "01101001 00101110 00001010 01010010 00110101 00010111 01011110 00000011 00010010 00011101" to it using XOR. Look up the result in the ascii table.
forty-two. forty-two.
## The bus in a computer is an example of which form of communication? ### The bus in a computer is an example of which form of communication?
Parallel Parallel
## Which of the following instructions does not fall in the category of arithmetic/logic instructions? ### Which of the following instructions does not fall in the category of arithmetic/logic instructions?
JUMP JUMP
## Which of the following parallel architectures allows fastest access to all memory cells from all processors ### Which of the following parallel architectures allows fastest access to all memory cells from all processors
Shared Memory Shared Memory
## Which of the following is not a form of parallel processing? ### Which of the following is not a form of parallel processing?
SISD SISD
## Which of the following instructions (as described in the language description table) changes the contents of a memory cell? ### Which of the following instructions (as described in the language description table) changes the contents of a memory cell?
40AB 40AB
## Which of the following instructions (as described in the language description table) places 00000000 in register 5? ### Which of the following instructions (as described in the language description table) places 00000000 in register 5?
9555 9555
## Which of the following instructions (as described in the language description table) will not change the contents of register 5? ### Which of the following instructions (as described in the language description table) will not change the contents of register 5?
A508 A508

26
3_Programming_Languages.md
View File

@ -1,38 +1,38 @@
## Most machine languages are based on the ### Most machine languages are based on the
Imperative paradigm Imperative paradigm
## Positions within arrays are identified by means of numbers called ### Positions within arrays are identified by means of numbers called
Indices Indices
## Which of the following is an example of a language that is based on the functional paradigm? ### Which of the following is an example of a language that is based on the functional paradigm?
LISP LISP
## Which of the following is a means of nullifying conflicts among data types? ### Which of the following is a means of nullifying conflicts among data types?
Coercion Coercion
## Which of the following is not a control statement? ### Which of the following is not a control statement?
Assignment statement Assignment statement
## Which of the following is not a possible value of the expression 4 + 6 / 2 - 1 ### Which of the following is not a possible value of the expression 4 + 6 / 2 - 1
5 5
## Which of the following is not a step in the process of translating a program? ### Which of the following is not a step in the process of translating a program?
Executing the program Executing the program
## Which of the following is not associated with object-oriented programming? ### Which of the following is not associated with object-oriented programming?
Resolution Resolution
## Which of the following is not associated with the concept of data type? ### Which of the following is not associated with the concept of data type?
Operator precedence Operator precedence
## Which of the following is the scope of a variable? ### Which of the following is the scope of a variable?
The portion of the program in which the variable can be accessed The portion of the program in which the variable can be accessed
## Author's note: i am not copying the program segment. ### Author's note: i am not copying the program segment.
## In contrast to ........ languages such as English and Spanish, programming languages are considered ........ ### In contrast to ........ languages such as English and Spanish, programming languages are considered ........
natural, formal natural, formal
## Match the terms with their definitions ### Match the terms with their definitions
Not copying that, but have a screenshot.. Not copying that, but have a screenshot..
![screencap](https://cdn.discordapp.com/attachments/458628210272239626/1038145187723100190/image.png) ![screencap](https://cdn.discordapp.com/attachments/458628210272239626/1038145187723100190/image.png)