Suppose you are given a data called "f" and a queue called "Q". Each record in "f" has "A" or "D" character. Write an algorithm that reads all the records in the file one by one. If record keeps "A" adds this record to "Q". If record keeps "D" delete an element from the "Q". FIle "f" and "Q" has the same type. Queue capacity 20 records

Suppose you are given a data called "f" and a queue called "Q". Each record in "f" has "A" or "D" character. Write an algorithm that reads all the records in the file one by one. If record keeps "A" adds this record to "Q". If record keeps "D" delete an element from the "Q". FIle "f" and "Q" has the same type. Queue capacity 20 records

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

Create a 5×5 list of random numbers between 1 and 10 inclusively. Then write a program that creates a dictionary whose keys are the numbers and whose values are how many times the number occurs. Then print the three most common numbers. An example is shown below:
def delete task (..., ...): I param: task_collection (list) holds all tasks; param: an integer ID indexes each task (stored as a dictionary) (str) - a string that is supposed to represent an integer ID that indexes the task in the list returns: 0 if the collection is empty. -1 - if the provided parameter is not a string or if it is not a string that contains a valid integer >=0 representing the task's position on the list. Otherwise, returns the item (dict) that was removed from the provided collection. 11 11 11
Python’s for loop allows the programmer to add or remove items in the collection over which the loop is iterating. Some designers worry that changing the structure of a collection during iteration might cause program crashes. The remedy is to make the for loop read-only, by disallowing mutations to the collection during iteration. You can detect such mutations by keeping a count of them and determining if this count goes up at any point within the collection’s __iter__ method. When this happens, you can raise an exception to prevent the computation from going forward. In the arraybag.py file complete the following in the ArrayBag class: In the __init__ method, include a new instance variable named modCount, which is set to 0. In the __iter__ method include a temporary variable named modCount, which is set initially to the value of the instance variable self.modCount. Immediately after an item is yielded within the __iter__ method, you raise an exception if the values of the two mod…
Description: Given a string, find the first non-repeating character in it and return its index. If it doesn't exist, return -1. Example 1 input: "leetcode" output: 0 Example 2 input: "loveleetcode" output: 2 The solution we are targeting here is a linear time solution since we have to go over the entire string to know which one is unique in it. A straightforward method we can easily think of is having a Dictionary record letter frequency. Subsequently, iterate over the input again and return the index that has a letter frequency of 1.
Write a python program that stores current grades in a dictionary, with course codes as keys and percent grades as values. Start with an empty dictionary and then use a while loop to enable input of course codes and percent grades from the keyboard. Enter data for at least five courses. After entering the data, use a for loop and the keys to show the current status of all courses. This same loop should include code that enables determination of the worst course and the average of all courses. Both of these findings should be printed when the loop ends. The worst course should be dropped and reported. This being done, the program should use another loop and the items method to display the revised courses and grades and report the revised term average.
ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…
In python and the code has to have the methods invoked through Test statements.Built in methods or libraries are not allowed. Sort a DOUBLY linked sequential list using insertion sort algorithma
Python Code Create a code that can plot a distance versus time graph by importing matplotlib and appending data from a text file to a list. Follow the algorithm: Import matplotlib. Create two empty lists: Time = [ ] and Distance = [ ] Open text file named Motion.txt (content attached). Append data from Motion.txt such that the first column is placed in Time list and the second column is placed in Distance list. Plot the lists (Distance vs Time Graph). You may use this following link as a source for matplotlib functions: https://datatofish.com/line-chart-python-matplotlib/ Show Plot.
The following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list Problem" Deletion of the last node in a single linked list Algorithm" Step 1: if HEAD = NULL Write UNDERFLOW Go to Step 8 Step 2: SET PTR = HEAD Step 3: Repeat Steps 4 and while PTR à NEXT = NULL Step 4: SET PREPPTR = PTR Step 5: SET PTR =PTR à NEXT [End of loop] Step 6: SET PREPTR à NEXT = NULL Step 7: FREE PTR Step 8: EXIT…
ATTEMPT ONLY IF YOU ARE 100% SURE . .CODE WITH COMMENTS AND OUTPUT SCREENSHOT IS MUST. DO NOT COPY FROM OTHER WEBSITES... write a C++ function that deletes last two elements from the queue (without using a helper data structure) : please use push and remove in the answer
A linear collection of data elements where its elements are accessed by means of a pointer is called a(n)? A. Linked list B. Record C. 1-D array D. Sorted list Justify your answer with explanations