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 78 pages
Exam (elaborations)

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

Document preview thumbnail
Preview 4 out of 78 pages

Your TM111 TMA 02 – 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 ( = 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 02 Marked Assignment with Tutor Feedback |
Questions and Answers | 2026 Update | 100% Correct - The Open
University. - 77 Questions and Answers Already Graded A+
Premium Exam Tested And Verified


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

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

Expected Grade A+

Total Questions 77

Duration 3 hours

Learning Outcomes 1. Demonstrate mastery of core concepts

Accreditation Aligned with US university standards.




Page 1

,Question 1 of 77
Convert the decimal number 23.375 to binary. Which of the following is its correct binary
representation?
A. 10111.011
B. 10111.101
C. 10011.011
D. 10111.110


The correct answer is:
Correct Action: 10111.011

Rationales
• 10111.011 (Correct):
This is the correct action. 23 in binary is 10111 (16+4+2+1). 0.375 in binary is 0.011 (0.5*0 + 0.25*1 + 0.125*1 = 0.375).
Combined: 10111.011. Option B has fraction 0.625, C has integer 19, D has fraction 0.75.
• 10111.101 (Incorrect):
This option is not appropriate. 0.375 in binary is 0
• 10011.011 (Incorrect):
This option is not appropriate. 0.375 in binary is 0
• 10111.110 (Incorrect):
This option is not appropriate. 0.375 in binary is 0




Page 2

,Question 2 of 77
A researcher wants to find documents that discuss either 'machine learning' or 'artificial
intelligence' but must also include 'ethics' and not include 'deep learning'. Which Boolean query
correctly represents this search?
A. (machine learning OR artificial intelligence) AND ethics NOT deep learning
B. (machine learning OR artificial intelligence) AND ethics AND NOT deep learning
C. (machine learning AND artificial intelligence) OR ethics NOT deep learning
D. machine learning OR artificial intelligence AND ethics NOT deep learning


The correct answer is:
Correct Action: (machine learning OR artificial intelligence) AND ethics AND NOT deep learning

Rationales
• (machine learning OR artificial intelligence) AND ethics AND NOT deep learning (Correct):
This is the correct action. Option B correctly uses parentheses for the OR group, then AND with ethics, and AND NOT to
exclude deep learning. Option A lacks an explicit AND before NOT, which may be ambiguous. Options C and D misgroup
terms, leading to incorrect results.
• (machine learning OR artificial intelligence) AND ethics NOT deep learning (Incorrect):
This option is not appropriate. Option A lacks an explicit AND before NOT, which may be ambiguous. Options C and D
misgroup terms, leading to incorrect results
• (machine learning AND artificial intelligence) OR ethics NOT deep learning (Incorrect):
This option is not appropriate. Option A lacks an explicit AND before NOT, which may be ambiguous. Options C and D
misgroup terms, leading to incorrect results
• machine learning OR artificial intelligence AND ethics NOT deep learning (Incorrect):
This option is not appropriate. Option A lacks an explicit AND before NOT, which may be ambiguous. Options C and D
misgroup terms, leading to incorrect results




Page 3

, Question 3 of 77
Consider the following recursive function f(n) where n is a non-negative integer. What is the output
of f(5)?
def f(n):
if n < 2:
return n
else:
return f(n-1) + f(n-2)
A. 5
B. 8
C. 13
D. 21


The correct answer is:
Correct Action: 5

Rationales
• 5 (Correct):
This is the correct action. This implements the Fibonacci sequence: f(0)=0, f(1)=1, f(2)=1, f(3)=2, f(4)=3, f(5)=5. Option A
is correct; B is f(6), C is f(7), D is f(8).
• 8 (Incorrect):
This option is not appropriate. Option A is correct; B is f(6), C is f(7), D is f(8).
• 13 (Incorrect):
This option is not appropriate. Option A is correct; B is f(6), C is f(7), D is f(8).
• 21 (Incorrect):
This option is not appropriate. Option A is correct; B is f(6), C is f(7), D is f(8).




Page 4

Document information

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

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