Escrito por estudiantes que aprobaron Inmediatamente disponible después del pago Leer en línea o como PDF ¿Documento equivocado? Cámbialo gratis 4,6 TrustPilot
logo-home
Document preview thumbnail
Vista previa 4 fuera de 48 páginas
Examen

TM111 TMA 01 MARKED ASSIGNMENT WITH TUTOR FEEDBACK | QUESTIONS AND ANSWERS | 2026 UPDATE | 100% CORRECT

Document preview thumbnail
Vista previa 4 fuera de 48 páginas

Your TM111 TMA 01 – Marked, Explained & Ready to Learn From! This is the actual TM111 TMA 01 assignment with real tutor feedback, correct answers, and detailed rationales. No guessing. No stress. Just exactly what you need to understand what your tutor is looking for. What's Inside: - All 47 TMA 01 questions – fully covered - Tutor feedback with detailed rationales – see why answers are correct - Correct answers verified – 100% reliable - Multiple-choice format with clear explanations for each option - Easy to read on your phone, tablet, or laptop - Perfect for understanding OU marking style and exam technique What You'll Actually Learn: - Binary arithmetic and two's complement representation - IEEE 754 floating-point representation - Data compression – lossless vs lossy, perceptual coding - Networking – ARP, UDP vs TCP, subnetting, broadcast addresses - Cryptography – asymmetric encryption, RSA, public/private keys - Web technologies – HTML5 semantics, CSS specificity, hex colors - Python programming – list comprehensions, mutable default arguments - Algorithm analysis – time complexity, Big-O notation - Computational thinking – abstraction, decomposition, pattern recognition - Relational databases – SQL queries, selection and projection - Hamming codes and error detection - Flowcharts and pseudocode - Digital logic – XOR gates - Accessibility – WCAG principles - Professional skills – phishing awareness, file management, APA citations, Gibbs' Reflective Cycle Real Questions You'll See: Question: In binary addition of two 4-bit signed integers using two's complement, the carry into the most significant bit is 1 and the carry out is 0. Which statement is true? ️ Answer: Overflow has occurred. (Carry-in differs from carry-out indicates overflow) Question: In IEEE 754 single-precision floating point, the exponent is stored with a bias of 127. If the stored exponent bits are , what is the actual exponent value? ️ Answer: 7 (134 - 127 = 7) Question: A 7-bit Hamming code with parity bits at positions 1,2,4 is used for error detection. If the received codeword is 1011010, which bit (if any) is in error? ️ Answer: Bit 5 Who This Is For: - You, if you're studying TM111 with The Open University - You, if TMA 01 is coming up and you're stressed - You, if you want to see exactly how a marked assignment looks - You, if you want to boost your grade by learning from real tutor feedback - You, if you want to understand the *why* behind every answer Stop guessing. Start understanding. Download this now and walk into TMA 01 with confidence.

Vista previa del contenido

TM111 TMA 01 Marked Assignment with Tutor Feedback |
Questions and Answers | 2026 Update - The Open University. - 47
Questions and Answers Already Graded A+ Premium Exam
Tested And Verified


Subject Area TM111 TMA 01 Marked Assignment with Tutor Feedback | Questions and
Answers | 2026 Update - The Open University.

Description Comprehensive examination on TM111 TMA 01 Marked Assignment with Tutor
Feedback | Questions and Answers | 2026 Update - The Open University..

Expected Grade A+

Total Questions 47

Duration 3 hours

Learning Outcomes 1. Demonstrate mastery of core concepts

Accreditation Aligned with US university standards.




Page 1

,Question 1 of 47
In binary addition of two 4-bit signed integers using two's complement, the carry into the most
significant bit is 1 and the carry out is 0. Which statement is true?
A. Overflow has occurred.
B. No overflow, the result is correct.
C. The result is negative and no overflow.
D. A borrow occurred during the addition.


The correct answer is:
Correct Action: Overflow has occurred.

Rationales
• Overflow has occurred. (Correct):
This is the correct action. Overflow in signed addition occurs when the carry into the MSB differs from the carry out. Here,
carry-in=1, carry-out=0, indicating overflow. Options B and C ignore this condition; D describes subtraction, not addition.
• No overflow, the result is correct. (Incorrect):
This option is not appropriate. Here, carry-in=1, carry-out=0, indicating overflow. Options B and C ignore this condition; D
describes subtraction, not addition
• The result is negative and no overflow. (Incorrect):
This option is not appropriate. Here, carry-in=1, carry-out=0, indicating overflow. Options B and C ignore this condition; D
describes subtraction, not addition
• A borrow occurred during the addition. (Incorrect):
This option is not appropriate. Here, carry-in=1, carry-out=0, indicating overflow. Options B and C ignore this condition; D
describes subtraction, not addition




Page 2

,Question 2 of 47
A streaming service stores audio files. To reduce bandwidth, they apply a compression algorithm that
discards frequencies inaudible to humans. This compression is best described as:
A. Lossless compression using Huffman coding.
B. Lossy compression using perceptual coding.
C. Lossy compression using run-length encoding.
D. Lossless compression using dictionary-based methods.


The correct answer is:
Correct Action: Lossy compression using perceptual coding.

Rationales
• Lossy compression using perceptual coding. (Correct):
This is the correct action. Discarding inaudible frequencies is perceptual coding, a form of lossy compression. Huffman and
dictionary methods are lossless; run-length encoding is also lossless and does not involve perceptual models.
• Lossless compression using Huffman coding. (Incorrect):
This option is not appropriate. Huffman and dictionary methods are lossless; run-length encoding is also lossless and does
not involve perceptual models.
• Lossy compression using run-length encoding. (Incorrect):
This option is not appropriate. Huffman and dictionary methods are lossless; run-length encoding is also lossless and does
not involve perceptual models.
• Lossless compression using dictionary-based methods. (Incorrect):
This option is not appropriate. Huffman and dictionary methods are lossless; run-length encoding is also lossless and does
not involve perceptual models.




Page 3

, Question 3 of 47
A network administrator has a subnet with prefix length /28. How many usable host addresses does
this subnet provide?
A. 14
B. 16
C. 30
D. 62


The correct answer is:
Correct Action: 14

Rationales
• 14 (Correct):
This is the correct action. A /28 prefix leaves 4 bits for host addresses, yielding 2^4 = 16 total addresses. After removing
the network and broadcast addresses, 14 are usable. B is the total address count; C and D correspond to /27 and /26 subnets.
• 16 (Incorrect):
This option is not appropriate. After removing the network and broadcast addresses, 14 are usable. B is the total address
count; C and D correspond to /27 and /26 subnets
• 30 (Incorrect):
This option is not appropriate. After removing the network and broadcast addresses, 14 are usable. B is the total address
count; C and D correspond to /27 and /26 subnets
• 62 (Incorrect):
This option is not appropriate. After removing the network and broadcast addresses, 14 are usable. B is the total address
count; C and D correspond to /27 and /26 subnets




Page 4

Información del documento

Subido en
1 de agosto de 2026
Número de páginas
48
Escrito en
2026/2027
Tipo
Examen
Contiene
Preguntas y respuestas
$14.09

¿Documento equivocado? Cámbialo gratis Dentro de los 14 días posteriores a la compra y antes de descargarlo, puedes elegir otro documento. Puedes gastar el importe de nuevo.
Escrito por estudiantes que aprobaron
Inmediatamente disponible después del pago
Leer en línea o como PDF

Seller avatar
Los indicadores de reputación están sujetos a la cantidad de artículos vendidos por una tarifa y las reseñas que ha recibido por esos documentos. Hay tres niveles: Bronce, Plata y Oro. Cuanto mayor reputación, más podrás confiar en la calidad del trabajo del vendedor.
GlobalExamBank
4.7
(3)
Vendido
13
Seguidores
1
Artículos
514
Última venta
1 mes hace



Por qué los estudiantes eligen Stuvia

Creado por compañeros estudiantes, verificado por reseñas

Calidad en la que puedes confiar: escrito por estudiantes que aprobaron y evaluado por otros que han usado estos resúmenes.

¿No estás satisfecho? Elige otro documento

¡No te preocupes! Puedes elegir directamente otro documento que se ajuste mejor a lo que buscas.

Paga como quieras, empieza a estudiar al instante

Sin suscripción, sin compromisos. Paga como estés acostumbrado con tarjeta de crédito y descarga tu documento PDF inmediatamente.

Student with book image

“Comprado, descargado y aprobado. Así de fácil puede ser.”

Alisha Student

Preguntas frecuentes