Often some situation arises in programming where data or input is dynamic in nature, i.e. the number of data item keeps changing during program execution. A live scenario where the program is developed to process lists of employees of an organization. The list grows as the names are added and shrink as the names get deleted. With the increase in name the memory allocate space to the list to accommodate additional data items. Such situations in programming require which technique. Explain the concept with the help of suitable examples. Write the program in C++ and use DMA . Please write a new code.

Often some situation arises in programming where data or input is dynamic in nature, i.e. the number of data item keeps changing during program execution. A live scenario where the program is developed to process lists of employees of an organization. The list grows as the names are added and shrink as the names get deleted. With the increase in name the memory allocate space to the list to accommodate additional data items. Such situations in programming require which technique. Explain the concept with the help of suitable examples. Write the program in C++ and use DMA . Please write a new code.

Name: Often some situation arises in programming where data or input is dyna
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Often some situation arises in programming where data or input is dynamic in nature,i.e. the number of data item keeps changing during program execution. A live scenario wherethe program is developed to process lists of employees of an organization.

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm TASK2: DESCRIPTION One of the simplest methods for memory allocation is to divide memory into several fixed-sized partitions. Each partition may contain exactly one process. In this multiple-partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process. The operating system keeps a table indicating which parts of memory are available and which are occupied. Finally, when a process arrives and needs memory, a memory section large enough for this process is provided. When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, then the operating system must decide which free block to allocate. Best-fit strategy chooses the block…
Imagine that you are in charge of arranging the information taken from books. Either more volumes should be added to the shelf, or present books should be removed from only one side of the shelf. Determine and define the data structure that is the best suited for this case. You need to come up with a dynamic approach of adding books to the shelf. What also takes place when fresh data has to be inserted into a data structure but there isn't enough capacity for it?
In java programming language An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each event has a time stamp that denotes the time when the event will occur. The simulation program needs to efficiently perform the following two fundamental operations: • Insert an event with a given time stamp (that is, add a future event). • Extract the event with smallest time stamp (that is, determine the next event to process). Question 3 3.1 Which data structure should be used for the above operations? Why? 3.2 Write an application that adds the following time stamp in the selected data structure. Event1 occurs at 12:00:54 Event2 occurs at 10:40:54 Event3 occurs at 11:30:45 Event4 occurs at 12:00:00 3.3 Write a method that extracts the smallest time stamp. 3.4 What is the maximum running time
Implement in C programming language: Question 2 Write a c program that will generate the safe sequence of process execution for the situation given below:(Use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 6; // Number of processes m = 4; // Number of resources int alloc[6][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 3 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 }, // P4 {1, 2 , 3, 1 } }; //P5 int max[6][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 4 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 }, // P4 { 6, 2 , 6, 5 } }; //P5 int avail[4] = { 2, 2, 2, 1 };…
*Reasking a question to make request clearer Looking to code in python the following: Suppose the weekly hours for all employees are stored in a table. Each row records an employee’s seven-day work hours with seven columns. For example, the following table stores the work hours for eight employees. Su M T W Th F Sa Employee 0 2 4 3 4 5 8 8 Employee 1 7 3 4 3 3 4 4 Employee 2 3 3 4 3 3 2 2 Employee 3 9 3 4 7 3 4 1 Employee 4 3 5 4 3 6 3 8 Employee 5 3 4 4 6 3 4 4 Employee 6 3 7 4 8 3 8 4 Employee 7 6 3 5 9 2 7 9 I need a program that inputs the hours of all employees by the user and displays employees and their total hours in decreasing order of the total hours. Thanks
C++ Can someone answer the following code below in C++: Please add to the project a print statement that says how long each version ran in milliseconds please! Version 1 of the process creation hierarchy uses linked lists to keep track of child processes as described in section "The process control block", subsection "The PCB data structure". For the purposes of performance evaluation, the PCBs are simplified as follows: All PCBs are implemented as an array of size n. Each process is referred to by the PCB index, 0 through n-1. Each PCB is a structure consisting of only the two fields: parent: a PCB index corresponding to the process's creator children: a pointer to a linked list, where each list element contains the PCB index of one child process The necessary functions are simplified as follows: create(p) represents the create function executed by process PCB[p]. The function creates a new child process PCB[q] of process PCB[p] by performing the following tasks: allocate a…
(THIS IS FOR MINDTAP ON CENGAGE, PLEASE USE THAT. ALTERNATIVE IS DEVC++5.11 BUT HIGHLY RECOMMENDED THAT YOU USE MINDTAP) Instructions Write a C++ program that declares an array alpha of 50 components of type double. Initialize the array so that the first 25 components are equal to the square of the index variable (the position that element will occupy), and the last 25 components are equal to three times the index variable. Output the array so that 10 elements per line are printed. (For the number at index 5, the value would be 25, which is 5 squared. The 25th index would hold a value of 75, which is 3 * 25.) An example of the program output is shown below:
Please provide an explanation for why deep access is better than shallow access from the perspective of a programmer; do not make your argument just on the basis of performance concerns.
Programs for Computers: In this part, we will go further into each of the four memory allocation strategies that we have seen up to this point in the course and discuss how each of these strategies works. How often, on average, does each of these four words really get used in real-world situations?
You are the sysadmin for a big tech company, and you have to estimate the amount of servers you need to handle some long-running jobs. One server can handle only one job at once. One job can only be executed by one server at once. Once a server has finished executing its current job, it can be reassigned to a new job. Given an array of time intervals intervals where intervals[i] = [starti, endi], representing the start and end time for a particular job that needs to be executed, return the minimum number of servers required to run all jobs. Constraints: 1 <= intervals.length <= 104 0 <= starti < endi <= 106 Function definition for Java: public int minMeetingRooms(int[][] intervals) { // Your code here } Function definition for Python: def minMeetingRooms(self, intervals: List[List[int]]) -> int: #Your code here Announced Test Cases: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2Explanation: We need one server for the job that starts at 0. For the job…
Write a C program to simulate producer-consumer problem using semaphores. TASK: DESCRIPTION Producer-consumer problem, is a common paradigm for cooperating processes. A producer process produces information that is consumed by a consumer process. One solution to the producer-consumer problem uses shared memory. To allow producer and consumer processes to run concurrently, there must be available a buffer of items that can be filled by the producer and emptied by the consumer. This buffer will reside in a region of memory that is shared by the producer and consumer processes. A producer can produce one item while the consumer is consuming another item. The producer and consumer must be synchronized, so that the consumer does not try to consume an item that has not yet been produced.
Consider an online auction system where the current highest bid for each item must be maintained. A person who wishes to bid on an item calls the bid(amount) function, which compares the amount being bid to the current highest bid. If the amount exceeds the current highest bid, the highest bid is set to the new amount. This is illustrated below:void bid(double amount) {if (amount > highestBid)highestBid = amount;} Describe how a race condition is possible in this situation and what might be done to prevent the race condition from occurring. Based on the solution you describe, rewrite the bid function that can solve the problem.