Fast Nuces Karachi has installed a Robo Accountant at Onestop. It can deal with a maximum of 15 students at a time. Students are supposed to make a queue to get all services one at a time. You are required to program its fee challan generation function. The services process in the following way: • First, Robo will generate a pin_code for all students after asking for their NU-ID. • Second, students will enter the generated pin_code to get a fee challan: for the program, the fee of the student on the fee challan is the sum of NU-ID digits. ● Last, every student will pay the fee of the person before him/her in the queue. Hint: for payment, the student must know the ID of the student behind him/her in the queue.

Fast Nuces Karachi has installed a Robo Accountant at Onestop. It can deal with a maximum of 15 students at a time. Students are supposed to make a queue to get all services one at a time. You are required to program its fee challan generation function. The services process in the following way: • First, Robo will generate a pin_code for all students after asking for their NU-ID. • Second, students will enter the generated pin_code to get a fee challan: for the program, the fee of the student on the fee challan is the sum of NU-ID digits. ● Last, every student will pay the fee of the person before him/her in the queue. Hint: for payment, the student must know the ID of the student behind him/her in the queue.

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

Q/ In java language Create a Queue (capacity of 10 Students) of 6 different students according to their ID number De-queue one students and En-queue two Students by displaying their Front and Rear Values.
8)A college has 5 departments, the total intake of each departments are 60, 76, 45, 80, 62 Use a sort technique that works by repeatedly stepping through the above intake values, and then enqueue the elements in a queue, one after another and display them.
You are approached by an online delivery shipping firm, which asks you to write them code for some tasks they face. The products they ship have some attributes, which are as follows: Product ID (Integer) [This is unique for every product] Product label (String) Manufacturer (String) All strings are of maximum length 100 and contain only alphanumeric characters. The products arrive one by one, and a common queue is maintained for all of them. Also, there is a fixed set of manufacturers the company has a tie-up with: Nike Adidas Reebok Puma Diadora You are to automate some repetitive tasks. The tasks are as follows: 1) Add a new product to the queue. 2) Deliver the next product of the queue and print the product information delivered. 3) Query how many products of a given manufacturer is currently present in the queue. 4) Query how many products of a given manufacturer has been shipped already. Initially, the product queue is empty. It is also guaranteed that when new products are…
Computer Science CODE IN C++: You have to design and implement a game in which the avatar has to find the hidden treasure in circus. Theonly way to guide the avatar and to find the treasure is to find the shortest path that leads to the hiddentreasure. You, being a developer are bound to use the Queue data structure. Among, depth first search andbreath first search, determine the most suitable algorithm and provide a complete code. Decide the suitablename of the avatar and the game since you are the designer. Data should be taken from the user. Makerelevant assumptions if required
Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab // it represents an array implementation of the stack. // it represents a Linked List implementation of the stack. arraylmpofStack.java pointerlmofStack.java pointerlmofQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arraylmpofStack.java then write a main method to read a sequence of numbers and using the stack operation print…
Problem: Implement a part of functionality for the Netflix DVD queue. It's a service that allows a user to create a list of desired movies and then sends DVDs with movies on top of this list to the subscriber one at a a time. A subscriber should be able to create a list of desired movies and manipulate the order in a movie queue in their account. Your program will implement some of the desired functionality by storing the list of movie titles in a linked list. You are provided with the following files available in "Downloadable files" section: MovieList.h contains a class declaration for the class that represents a list of movies. Driver.cpp contains a main function you can use to test your implementation. You will be responsible for providing the MovieList.cpp file, including the implementation of the MovieList member functions (described below): MovieList and ~MovieList: creates an empty list, and deallocates all the nodes in the list, respectively. display(ostream& out) Print…
C/C++ Using linked lists implement an amusement park reservation system. The system allows a person to make a reservation for a specific date. A person can change the reservation date or even cancel his booking anytime. The system puts all reservations in a queue. The park will allow only certain number of persons on any given day in order the reservation was made. For each day the system will print out persons allowed to visit the park. For sake of simplicity, dates are being confined to 15th to 30th. The system should ask the user to enter code for different operations. It reads all data from the datafile amusement.dat. The first integer on datafile indicates limit of persons allowed on any day. i)code 1: make reservation, system expects date followed by name (within 20 characters) and makes reservation. If number of bookings exceeds allowed number, then system prints SORRY, QUOTA OVER and moves over to read next code. ii)code 2: change date of reservation, system expects old date,…
if there are no elements in the queue then a . .function caused underflow condition. Answer:
True/False Select true or false for the statements below. Explain your answers if you like to receive partial credit. 3) Which of the following is true about the insertBeforeCurrent function for a CircularLinked List (CLL) like you did in programming exercise 1?a. If the CLL is empty, you need to create the new node, set it to current, andhave its next pointer refer to itselfb. The worst case performance of the function is O(n)c. If you insert a new element with the same data value as the current node, theperformance improves to O(log n)
Case study: An event company asks you to design the data structure and program prototype for their running event system. The participant for the running event is expected to reach more than 1000 in various categories. You decided to use hashing function method to store the information for each participant's BIB number in the hash table. To begin the problem solving, suppose that 10 registered runners need to be stored in a hash table, HT, with a size of 13. The sample BIB number of the runners are: 101, 102, 103, 104, 107, 111, 121, 217, 157, and 185. Furthermore, you set the hash function to determine the index of the participant in the HT as: hash (BIB) = BIB % table size (or 13) However, if the hash index given by hash(BIB) is already occupied (collision), the linear probing hash function will be used as: hash (BIB) = (Hash (BIB)+1) % 17 and, further collision with hash function: hash (BIB) = (Hash(BIB)+2) % 17 or, hash(BIB) = (Hash (BIB) + n) % 17, where n is probe increment. Refer…
Make sure your program use dynamic queue as the data strcuture and simulates the whole executions till completion. Your program should prints the time when the print job from each student started and their waiting time. It also need to calculate the time needed to complete all printing jobs and the average waiting time.
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);