Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Questions 1-3: Assume radix sorting of 1024 unsigned integers on a 32-bit machine with 4 passes (rounds). The integers are initially stored in Ist[1024] and the sorted integers will be available in 1st at the end of sorting. int buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result after 4 passes are completed. For example, moving 1st[i] to buf[j], or buf[j]=lst[i]; is a data assignment. 4. For floating point radix sort, assuming exactly half (512 floats) is negative, what is the num- ber of data assignments for correcting the result?

Questions 1-3: Assume radix sorting of 1024 unsigned integers on a 32-bit machine with 4 passes (rounds). The integers are initially stored in Ist[1024] and the sorted integers will be available in 1st at the end of sorting. int buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result after 4 passes are completed. For example, moving 1st[i] to buf[j], or buf[j]=lst[i]; is a data assignment. 4. For floating point radix sort, assuming exactly half (512 floats) is negative, what is the num- ber of data assignments for correcting the result?

Database System Concepts
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
icon
Related questions
Topic Video
Question

please answer 1 to 4 its realted to eachother and bartly allows 1 question with 3 sub question so please answer this is not garding question this is practice questions given by prof 

Questions 1-3: Assume radix sorting of 1024 unsigned integers on a 32-bit machine with 4 passes (rounds). The integers are initially stored in Ist[1024] and the sorted integers will be available in 1st at the end of sorting. int buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result after 4 passes are completed. For example, moving 1st[i] to buf[j], or buf[j]=lst[i]; is a data assignment. 4. For floating point radix sort, assuming exactly half (512 floats) is negative, what is the num- ber of data assignments for correcting the result?
Transcribed Image Text:Questions 1-3: Assume radix sorting of 1024 unsigned integers on a 32-bit machine with 4 passes (rounds). The integers are initially stored in Ist[1024] and the sorted integers will be available in 1st at the end of sorting. int buf[1024] is available as working space. 1. What is the number of buckets? 2. The bit mask in hexadecimal is? 3. Find the number of data assignments for correcting the result after 4 passes are completed. For example, moving 1st[i] to buf[j], or buf[j]=lst[i]; is a data assignment. 4. For floating point radix sort, assuming exactly half (512 floats) is negative, what is the num- ber of data assignments for correcting the result?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Instruction Format
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS