Consider a quaternary, normalized floating-point number system that is base 4 with chop-ping. Analogous to a bit, a quaternary digit is a quit. Assume that a hypothetical quaternarycomputer uses the following floating-point representation:SmSee2929394is the sign of the mantissa and se is the sign of the exponent (0 for positive, 1for negative), q1, 92, 93 and q4 are the quits of the mantissa, and e1, e2 are the quits of theexponent, an integer, and each quit is 0,1, 2 or 3. Show all your work for all parts.where Sm(a) What is the computer representation of –7.187510 in this system?(b) What decimal value does 00101321 represent in this system?(c) What is the maximum negative (non-zero) number that can be represented in thissystem? Give its value in decimal.(d) Let p be a real number in the interval (6410, 25610). If we need to represent p inthis quaternary floating-point system with some p*, what is the upper bound on theabsolute error of this representation? Your answer should be in decimal.

Consider a quaternary, normalized floating-point number system that is base 4 with chop- ping. Analogous to a bit, a quaternary digit is a quit. Assume that a hypothetical quaternary computer uses the following floating-point representation: Sm Se ei e2 92 93 94 where sm is the sign of the mantissa and se is the sign of the exponent (0 for positive, 1 for negative), q1, 42, q3 and q4 are the quits of the mantissa, and e1, e2 are the quits of the exponent, an integer, and each quit is 0,1, 2 or 3. Show all your work for all parts. (a) What is the computer representation of –7.187510 in this system?

Consider a quaternary, normalized floating-point number system that is base 4 with chop- ping. Analogous to a bit, a quaternary digit is a quit. Assume that a hypothetical quaternary computer uses the following floating-point representation: Sm Se ei e2 92 93 94 where sm is the sign of the mantissa and se is the sign of the exponent (0 for positive, 1 for negative), q1, 42, q3 and q4 are the quits of the mantissa, and e1, e2 are the quits of the exponent, an integer, and each quit is 0,1, 2 or 3. Show all your work for all parts. (a) What is the computer representation of –7.187510 in this system?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

use R program to come up with: 9*(-9)102,9*(-9)101 + 9*(-9)100 + 99*(-9)99 + 99*(-9)98 + 9*(-9)97 + 9*(-9)96 + 9*(-9)95 97*(-9)94 + 97*(-9)93+... 3(-9)4+3(-9)3 +9*(-9)2 + 9*(-9) + 9 an equation that prints out this
1. P VI V2 V3 V4 V5 V6 V7 V8 V9 Using the matrix P from the Floyd's II algorithm V2 9 VI 0 0 9 0 09 0: 9 8 8 8 6 0 0 8 8 8 0 9 0 V3 5 5 0 9 5 0 0 9 V4 0 0 5 0 0 2 7 V6 9 0 9 0 0 9 1 0 8 8 V5 0 1 9 0 6 8 0 0 V7 9 9 9 V8 9 9 9 9 9 7 9 0 9 0 0 9 0 6 7 V9 5308OOS 3 0 Find the path from v4 to v that has the minimum cost:
The assignment is to create a MIPS program that demonstrates that the associative law fails in addition for floating point numbers (single or double precision). You only need to demonstrate it for single precision. Remember the associative law is a + (b + c) = (a + b) + c. The key is to have two of the number large (one positively and one negatively but equal in magnitude) floating point numbers and the third floating point number very small in comparison. ***Please make sure you include comments in every field*** Note: make sure the program operats and doesnt run with errors like: operand is of incorrect type or not formatted
Suppose the characters 0,1,...,8,9, A,B,C,D,E,F are used to represent a hex adecimal (base-16) number. Here A = 10 B =11,..., F = 15 What is the largest base-10 integer that can be represented with a two-digit hexadecimal number, such as 14 or 3A? (A) 32 (B) 225 (C) 255 (D) 256 (E) 272
From Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer, 2nd edition Apply Algorithm 1.4.1 on P.38(picture attached) with f(x)=x^3+2^x, T = 100, A = 5, B = 4, δ = 0.1. Draw the corresponding walkthrough as shown in P.39(picture attached)
Our everyday number system in the UK and many other parts of the world is a base-10 system using Arabic numerals, namely the digits 0, 1, 9. Integers larger than 9 are represented by sequences of these elementary numerals. The numerical value encoded by such a sequence is determined by multiplying each numeral by 10k, where k is the position of the numeral counted from the back and starting at zero, and then summing together the contributions from all numerals. For example, 5207 = 5 × 10³ +2×10² +0×10¹ + 7×10⁰ The built-in int function in Python can take a string (type str) representing such a number and convert it to a Python integer (type int). Write a similar function base14_convert that takes a string and converts it to a Python integer according to the following number system: • the base is 14, i.e., the individual digits have to be multiplied by powers of 14 to obtain the numerical value; digits are represented by lower-case letters 'a', 'b', 'c', 'd', ..., i.e., 'a' is…
Consider the string of data #. The ASCII value of data # is 23 H which has to be moved from source memory to destination memory. Calculate the 20 bit PA of source memory and destination memory. Assume CS=2000 H, DS=5000 H, SS=6000 H, ES=8000 H. BX=1234 H, BP=2434 H, SP=3500 H, SI=4000 H, DI=5276 H, IP=D1245 H.
The Virtual Weight (VW) of an integer number (which consists of more than 1 digit) is the sumof the individual digits that are composing the number. For example, consider the followingtwo numbers; 5638 and 1145, then the VW of each is calculated as following:VW(5638) = 5+6+3+8 = 22VW(1145) = 1+1+4+5 = 11Then, the VW can be classified as L (mean Low) or H (means High) using a specific cut-offvalue. For example, if the cut-off value is 15, then the VW of the number 5638 is H (High),and the VW of the number 1145 is L because 22 > 15 and 11 ≤ 15 respectivelyWrite a C++ program that: reads a positive integer n (where 5≤n≤20) from the user. If the user enters invalidnumber, then the program should continue prompting until he/she enters a valid numberwithin the specified range. Then, the program should generate n random numbers using the built-in rand()function. Every time a random number is generated, the program will classify that number as Lor H using the above method. Use a…
Problem 1. We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different "digits" {0, 1,..., 9). Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0, 1, ..., 9, A, B, C, D, E, F) where A, B, C, D, E and F represent digits with values 10, 11, 12, 13, 14 and 15, respectively. So for example, a 3 digit hexadecimal number might be 2B8 = 8 + (B) 16+ (2) 16² = 8+ (11) 16+ (2) 16² = 696. (a) How many 2-digit hexadecimals are there in which the first digit is E or F? Explain your answer in terms of the additive principle (using either events or sets). (b) Explain why your answer to the previous part is correct in terms of the multiplicative principle (using either events or sets). Why do both the additive and multiplicative principles give you the same answer? (c) How many 3-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)? Explain. (d) How…
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. For example: Input: 5 Output: True because the binary representation of 5 is: 101. Input: 7 Output: False because the binary representation of 7 is: 111. Input: 11 Output: False because the binary representation of 11 is: 1011. Input: 10 Output: True because The binary representation of 10 is: 1010. """ # Time Complexity - O(number of bits in n) def has_alternative_bit(n): first_bit=0 second_bit=0 whilen: first_bit=n&1 ifn>>1:.
Assume you have a base 10 computer that stores floating-point numbers using a 5 digit normalized mantissa (x.xxxx), a 4 digit exponent, and a sign for each. (a) For this machine, what is machine epsilon? (b) What is the smallest positive normalized number that can be represented exactly in this machine?
An irreducible polynomial of degree 8 over GF(2) is given as f(x) =x+x+x'+x +1. This can be used to define GF(2)=GF(256) which is frequently used to design a code over the ASCII symbols consisting of 8 bits. We will use the following notation, for a, e GF(2), e ar + a,r+ ar ++ aa +a, (A) Write a computer program of addition and multiplication for all the binary 8-tuples as above and answer to the following questions: (B) Find any member a in GF(256) with the property that a, a², a²̟., a5 are all distinct, Calculate as al28, and a4. ANSWER: ) :a binary 8-tuple ):a binary 8-tuple ):a binary 8-tuple ):a binary 8-tuple a = ( a4 = ( a12 =( ass = ( (C) Calculate the multiplications a a, att . atza, and a al0 using your program in (A). Verify, for example, that a at = al+64 = ats, a*. a1zi - att12- al92 etc. (D) Define a linear function g from GF(256) to itself such that g(x) = x for any x in GF(256). Here, the linearity implies that g preserves two operations of the field. That is, for any…