Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
-PROBLEM C. -----.

-PROBLEM C. -----.

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

----------PROBLEM C. -----. 

 

Problem: C Implement doubly linked list using dummy node with following operations. 1. ins key_of_y key_of_x (insert command) /* Insert node x after node y. First search node y using a key value. If node y is found then insert node x after node y. Otherwise insert node x after dummy node. (remove command) Search a node x using a key value then delete it from the list if found. (search command) Search whole linked list against a key number. (showall command) Traverse whole linked list and print all key values. (exit command) */ 2. del key_of_x /* * 3. sch search_key /* 4. shw /* */ 5. ext /* Exit from the program. Sample input ins 3 1 ins 1 2 ins 1 3 ins 24 ins 5 0 ins 0 2 shw del 2 del 2 del 2 del 0 shw sch 1 sch 2 ext Sample output INSERT after dummy node. INSERT after 1. INSERT after 1. INSERT after 2. INSERT after dummy node. INSERT after 0. 021324 Node with key value 2 is DELETED. Node with key value 2 is DELETED. DELETE not possible. Node with key value 0 is DELETED. 134 Node with key value 1 is FOUNDED. Not FOUND.
Transcribed Image Text:Problem: C Implement doubly linked list using dummy node with following operations. 1. ins key_of_y key_of_x (insert command) /* Insert node x after node y. First search node y using a key value. If node y is found then insert node x after node y. Otherwise insert node x after dummy node. (remove command) Search a node x using a key value then delete it from the list if found. (search command) Search whole linked list against a key number. (showall command) Traverse whole linked list and print all key values. (exit command) */ 2. del key_of_x /* * 3. sch search_key /* 4. shw /* */ 5. ext /* Exit from the program. Sample input ins 3 1 ins 1 2 ins 1 3 ins 24 ins 5 0 ins 0 2 shw del 2 del 2 del 2 del 0 shw sch 1 sch 2 ext Sample output INSERT after dummy node. INSERT after 1. INSERT after 1. INSERT after 2. INSERT after dummy node. INSERT after 0. 021324 Node with key value 2 is DELETED. Node with key value 2 is DELETED. DELETE not possible. Node with key value 0 is DELETED. 134 Node with key value 1 is FOUNDED. Not FOUND.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 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