3. (a) Explain the notation {Pre} Code {Post}. Explain in your answer the difference between total and partial correctness. (b) Which of the following statements are true? In each case you should justify your argument informally. i. {x > Y} X + X * 2 Y+Y div 2 { x - Y > 0} X +X +1 ii. {x is even} {x is odd} X + 2 * X X+ 2 * Y iii. {x = Y} {x = Y} Y + 2 * X (c) A palindromic number is a number that is the same if read forwards or backwards: 12321 and 641146 are examples. It is possible to represent a number using an array of digits (numbers 0 - 9), for example: [1,9,5, 2] could represent 1952. i. Using an appropriate iteration construct, write an algorithm as a procedure that decides if an input array A[...n] of digits is a palindromic number. ii. Repeat question (i) but write your algorithm as a recursive procedure. Show how your algorithm works by giving a trace of the computation with the array (1,2, 2, 1].
3. (a) Explain the notation {Pre} Code {Post}. Explain in your answer the difference between total and partial correctness. (b) Which of the following statements are true? In each case you should justify your argument informally. i. {x > Y} X + X * 2 Y+Y div 2 { x - Y > 0} X +X +1 ii. {x is even} {x is odd} X + 2 * X X+ 2 * Y iii. {x = Y} {x = Y} Y + 2 * X (c) A palindromic number is a number that is the same if read forwards or backwards: 12321 and 641146 are examples. It is possible to represent a number using an array of digits (numbers 0 - 9), for example: [1,9,5, 2] could represent 1952. i. Using an appropriate iteration construct, write an algorithm as a procedure that decides if an input array A[...n] of digits is a palindromic number. ii. Repeat question (i) but write your algorithm as a recursive procedure. Show how your algorithm works by giving a trace of the computation with the array (1,2, 2, 1].
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
please send answer Q3 for part b i
please send proper answer
![3. (a) Explain the notation {Pre} Code {Post}. Explain in your answer the difference
between total and partial correctness.
(b) Which of the following statements are true? In each case you should justify your
argument informally.
X + X* 2
i. {x > Y}
{ x - Y > 0}
Y +Y div 2
ii. {x is even}
X + X +1
X + 2 * X
{x is odd}
X + 2 * Y
iii. {x = Y}
{x = Y}
Y + 2 * X
(c) A palindromic number is a number that is the same if read forwards or
backwards: 12321 and 641146 are examples. It is possible to represent a
number using an array of digits (numbers 0 - 9), for example: [1,9, 5, 2] could
represent 1952.
i. Using an appropriate iteration construct, write an algorithm as a procedure
that decides if an input array A[1...n] of digits is a palindromic number.
ii. Repeat question (i) but write your algorithm as a recursive procedure. Show
how your algorithm works by giving a trace of the computation with the array
[1, 2, 2, 1).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F62448a35-ad06-4db8-ba7d-9176b3d71047%2F3f3f19c8-d18e-4274-9042-40c3b641136d%2Fha4ay0j_processed.jpeg&w=3840&q=75)
Transcribed Image Text:3. (a) Explain the notation {Pre} Code {Post}. Explain in your answer the difference
between total and partial correctness.
(b) Which of the following statements are true? In each case you should justify your
argument informally.
X + X* 2
i. {x > Y}
{ x - Y > 0}
Y +Y div 2
ii. {x is even}
X + X +1
X + 2 * X
{x is odd}
X + 2 * Y
iii. {x = Y}
{x = Y}
Y + 2 * X
(c) A palindromic number is a number that is the same if read forwards or
backwards: 12321 and 641146 are examples. It is possible to represent a
number using an array of digits (numbers 0 - 9), for example: [1,9, 5, 2] could
represent 1952.
i. Using an appropriate iteration construct, write an algorithm as a procedure
that decides if an input array A[1...n] of digits is a palindromic number.
ii. Repeat question (i) but write your algorithm as a recursive procedure. Show
how your algorithm works by giving a trace of the computation with the array
[1, 2, 2, 1).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY