struct Book {int bookNo;char bookName [100];struct Book* next;};struct Queue {struct Book *front, *rear;};struct Book* newNode (int bNo, char bName [10]) {struct Book temp = (struct Book*) malloc (sizeof (struct Book) );temp->bookNo = bNo;strepy (temp->bookName, bName);temp->next = NULL;return temp;};struct Queue createQueue () {struct Queue* q = (struct Queue*) malloc (sizeof (struct Queue) );q->front = q->rear = NULL;return q;};int main () {struct Queue* g = createQueue ();enQueue (q, 01, "The History of Geumga Plaza");enQueue (q, 02, "Unbeatable of Vincenzo Casano");deQueue (q) :enQueue (q, 03, "The Rackless Babel Company");deQueue (q) ;enQueue (q, 04, "It It's Okay to Not Be Okay");printf ("First Queue of the book : td Book Title : $s\n",q->Iront->DOOKNO, g->Iront->booKName) ;: d Book Title : $s \n",printf ("Last Queue of the bookq->rear->bookNo, q->rear->bookName) ;return 0;Figure Q3a)Write a function named enqueue () with 3 parameters to insert theelements in a queue.

The code below is to create a queue of books using linked lists Queue and Book and using functions…

Answered: struct Book { int bookNo; char bookName…

Engineering

Computer Science

struct Book { int bookNo; char bookName [100]: struct Book next;

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

Widest and narrowest scope + what does the negation have scope over
In C++ Syntax for arrays of objects classGrades allCS[15]; //the default constructor is applied to //all elements of this array //to set the number of students in each class to 25 for (i = 0; i < 15; i++) { allCS[i].setNumStudents(25); } //Assume values in all classes. Write the code to print all class averages?
1. Struct (Optional: 1 point)1) Use the following abstract data type called Rectangle to get the length and width from the user. 2) Display the length, width, area, perimeter, and whether the rectangle is a square.struct Rectangle{float length;float width;float area;float perimeter;};2. Linked List (Optional: 1 point)Modify the following program to make a node containing data values of int, char, and string:#include <iostream>using namespace std;struct Node { int data; struct Node *next; };struct Node* head = nullptr; //or NULL or 0;void insert(int new_data) { struct Node* new_node = (struct Node*) new (struct Node); new_node->data = new_data; new_node->next = head; head = new_node; } void display() { struct Node* ptr;ptr = head;while (ptr != NULL) { cout<< ptr->data <<" "; ptr = ptr->next; } } int main() { insert(2);display(); return 0; } 1) Create a linked list of ten nodes (each node contains the three types of data values). 2) Display the data values…
A(n) ______________data member represents class-wide information
C# Encapsulation Example Following is the example of defining an encapsulated class in c# programming language. using System; using System.Text; namespace Tutlane { class User { private string location; private string name; public string Location { get { return location; } set { location = value; } } public string Name { get { return name; } set { name = value; } } } class Program { static void Main(string[] args) { User u = new User(); // set accessor will invoke u.Name = "Suresh Dasari"; // set accessor will invoke u.Location = "Hyderabad"; // get accessor will invoke Console.WriteLine("Name: " + u.Name); // get accessor will invoke Console.WriteLine("Location: " + u.Location); Console.WriteLine("\nPress Enter Key to Exit.."); Console.ReadLine(); } } } As you can see from the example above, we used properties to specify the fields in the enclosed class, and we can change the values of the fields by using the get and set accessors of properties. 1. Can you…
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
Write JAVA code General Problem Description: It is desired to develop a directory application based on the use of a double-linked list data structure, in which students are kept in order according to their student number. In this context, write the Java codes that will meet the requirements given in detail below. Requirements: Create a class named Student to represent students. In the Student class; student number, name and surname and phone numbers for communication are kept. Student's multiple phones number (multiple mobile phones, home phones, etc.) so phone numbers information will be stored in an “ArrayList”. In the Student class; parameterless, taking all parameters and It is sufficient to have 3 constructor methods, including a copy constructor, get/set methods and toString.
When constructing structure instances, why should you use the new operator?
Computer Science //iterator() creates a new Iterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::Iterator DoublyLinkedList<ValueType>::iterator(){//return iterator(head);} //constIterator() creates a new ConstIterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::ConstIterator DoublyLinkedList<ValueType>::constIterator() const{//return constIterator(head);} //Initializes a newly-constructed IteratorBase to operate on//the given list. It will initially be referring to the first//value in the list, unless the list is empty, in which case//it will be…
Please just use main.cpp,sequence.cpp and sequence.h. It has provided the sample insert()function. No documentation (commenting) is required for this assignment. This assignment is based on an assignment from "Data Structures and Other Objects Using C++" by Michael Main and Walter Savitch. Use linked lists to implement a Sequence class that stores int values. Specification The specification of the class is below. There are 9 member functions (not counting the big 3) and 2 types to define. The idea behind this class is that there will be an internal iterator, i.e., an iterator that the client cannot access, but that the class itself manages. For example, if we have a Sequence object named s, we would use s.start() to set the iterator to the beginning of the list, and s.advance() to move the iterator to the next node in the list. (I'm making the analogy to iterators as a way to help you understand the point of what we are doing. If trying to think in terms of iterators is confusing,…
Movie search system that displays actors and information about the movie. If you search for an actor, it should show you her or his movies. This can be in C++ and must use a data applied structure such as bubble sort or graph wise or using BTS. I would suggest with a BTS type of system
What effect does the new operator have when constructing instances of structures?