11. An ordered linked list of characters has been constructed using the array-based mplementation. The following diagram has a linked list pointed by first where items are in alphabetical order and another linked list pointed by free that has available pool of nodes. Node data next iv. first-3 free = 5 first-3 0 free = 5 1 2 first-3 3 free = 5 4 5 Node 0 1 Write in order the contents (data) of the nodes of the linked list pointed by first. 2 List the address (index) of the nodes in the storage pool pointed by free in the order in which they are linked together. iii. Show the changes in the data and next members of the nodes and the values of first and free after the letter D is inserted in the linked list so that the linked list is still in alphabetical order. Make changes in this figure where necessary 3 4 5 Node 0 1 2 H 3 X 4 P E F 5 B 7 C M data H X P E F Show the changes in the data and next members of the nodes and the values of first and free after the front item of the linked list pointed by first (node index #3) is deleted. Make changes in this figure where necessary. B C M data H 2 6 X 0 1 P E F 4 B C -1 M next 2 6 0 1 4 next 7 2 6 0 1 4 -1

11. An ordered linked list of characters has been constructed using the array-based mplementation. The following diagram has a linked list pointed by first where items are in alphabetical order and another linked list pointed by free that has available pool of nodes. Node data next iv. first-3 free = 5 first-3 0 free = 5 1 2 first-3 3 free = 5 4 5 Node 0 1 Write in order the contents (data) of the nodes of the linked list pointed by first. 2 List the address (index) of the nodes in the storage pool pointed by free in the order in which they are linked together. iii. Show the changes in the data and next members of the nodes and the values of first and free after the letter D is inserted in the linked list so that the linked list is still in alphabetical order. Make changes in this figure where necessary 3 4 5 Node 0 1 2 H 3 X 4 P E F 5 B 7 C M data H X P E F Show the changes in the data and next members of the nodes and the values of first and free after the front item of the linked list pointed by first (node index #3) is deleted. Make changes in this figure where necessary. B C M data H 2 6 X 0 1 P E F 4 B C -1 M next 2 6 0 1 4 next 7 2 6 0 1 4 -1

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

how to convert into c++
4. Discuss about the following operators in C language with example. a. Bitwise operators b. Increment and decrement operators c. Logical operators
2. Create a program in C++ that will let the user choose between two types of input (letter or number) then the program will classify if the inputs are palindrome or not. (30)
Evaluate the following arithmetic expression as the C++ system would evaluate it. 12 /4 3 * 2
Create a C++ programme that counts the total digits in a number.
C program, similar question from the book C how to program eighth edition question 4.14 but the problem add the -1
Prime ,perfect, palindrom using function in c++ programm
Write a C++ Program to produce the first 100 fibonacci numbers
1. What is the String Statement? 2. How do you execute String Statement in C programming?
Create a code in C ++ whose function is to convert a decimal number to an octal one
Create a C++ programme that displays the factorial of an integer.
40- A C++ code line ends with • A Semicolon (;) • A Comma (,) • A Full stop(.) • A Slash (/)