Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 4 out of 48 pages
Exam (elaborations)

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

Document preview thumbnail
Preview 4 out of 48 pages

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.

Content preview

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

Document information

Uploaded on
August 1, 2026
Number of pages
48
Written in
2026/2027
Type
Exam (elaborations)
Contains
Questions & answers
$14.09

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
GlobalExamBank
4.7
(3)
Sold
13
Followers
1
Items
514
Last sold
1 month ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions