Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Implementation in pseudocode

Implementation in pseudocode

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
Question
Implementation in pseudocode
4. task: Even and odd. We extend common operations on a dictionary D with the operations Odd (D, a, b) and Even (D, a, b), which return the number of odd or even elements in the dictionary D that are greater than or equal to a and less than or equal to b. For example, if D = {665, 963, 330, 851, 334, 424, 696, 620, 706, 957}, then Odd (D, 505, 864) returns 2 and Even (D, 505, 864) returns 3. On the other hand both Odd (D, 864, 505) and Even (D, 864, 505) re- turn 0. QUESTIONS: A) (i.) Implement such an extended dictionary D using ordinary linked list and ordered linked list. (ii.) What is the time complexity of both operations in each of implementations? Justify your answer. HINT: Describe the data structure and describe how it is maintained with operations. Write down a pseudocode for both new operations. B) (i.) Implement such an extended dictionary D using skip list. (ii.) What is the time complexity of both operations in this implementation? Justify your answer.
Transcribed Image Text:4. task: Even and odd. We extend common operations on a dictionary D with the operations Odd (D, a, b) and Even (D, a, b), which return the number of odd or even elements in the dictionary D that are greater than or equal to a and less than or equal to b. For example, if D = {665, 963, 330, 851, 334, 424, 696, 620, 706, 957}, then Odd (D, 505, 864) returns 2 and Even (D, 505, 864) returns 3. On the other hand both Odd (D, 864, 505) and Even (D, 864, 505) re- turn 0. QUESTIONS: A) (i.) Implement such an extended dictionary D using ordinary linked list and ordered linked list. (ii.) What is the time complexity of both operations in each of implementations? Justify your answer. HINT: Describe the data structure and describe how it is maintained with operations. Write down a pseudocode for both new operations. B) (i.) Implement such an extended dictionary D using skip list. (ii.) What is the time complexity of both operations in this implementation? Justify your answer.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
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