Question #2:- (Display the list records of the distribution class only) After solved the Question #1, attempt the following tasks: 1. Declare the collection object of the Grain-Distribution class using the List/Array(with 6 Length) dataType in Main-Method. 2. Assign all values of 6 records in your list/array object one by one. 3. Display all records on the screen of your Console or WinForm application. Expected output list records for the child class DistributionID DistDate DistQuantity Grainld GrainName cardHolderld cardHolderName cardHolderAddress cardHolderType COVID-19 COVID-19 1 Ahmed Orangi Town Korangi Jail Roal 1 01-Apr-20 5 kg 2 01-Apr-20 5 kg 3 01-Apr-20 2 kg 4 10-Apr-20 5 kg 5 10-Apr-20 5 kg 6 10-Apr-20 2 kg 1 Rrice 2 Flour 2 Bilal 3 Lentils (Dal) 3 Fahad 2 Bilal COVID-19 COVID-19 1 Rrice 2 Flour Korangi Jail Roal 3 Fahad 1 Ahmed COVID-19 COVID-19 3 Lentils (Dal) Orangi Town

Question #2:- (Display the list records of the distribution class only) After solved the Question #1, attempt the following tasks: 1. Declare the collection object of the Grain-Distribution class using the List/Array(with 6 Length) dataType in Main-Method. 2. Assign all values of 6 records in your list/array object one by one. 3. Display all records on the screen of your Console or WinForm application. Expected output list records for the child class DistributionID DistDate DistQuantity Grainld GrainName cardHolderld cardHolderName cardHolderAddress cardHolderType COVID-19 COVID-19 1 Ahmed Orangi Town Korangi Jail Roal 1 01-Apr-20 5 kg 2 01-Apr-20 5 kg 3 01-Apr-20 2 kg 4 10-Apr-20 5 kg 5 10-Apr-20 5 kg 6 10-Apr-20 2 kg 1 Rrice 2 Flour 2 Bilal 3 Lentils (Dal) 3 Fahad 2 Bilal COVID-19 COVID-19 1 Rrice 2 Flour Korangi Jail Roal 3 Fahad 1 Ahmed COVID-19 COVID-19 3 Lentils (Dal) Orangi Town

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

Exercise 1• Create a class that sorts a list in ascending order. Make use of the Collections method sort• The list should be a list of Strings.• Test your code with {“Hearts”, “Diamonds”, “Clubs”, “Spades”}• Before and after the sort, use the implicit call to the list’s toString method to output the list contents. Exercise 2• Create a class with the same requirement as in Exercise 1, but the sort should be in descending order• Make use of the Comparator interface• Make use of the static collection method reverseOrder java
I'm trying to understand LargeIntList classes for lists, I was wondering these statements or True or False? either or, can you please explain your answers? Thank you. Uses the “by copy” approach with its elements. Implements the ListInterface interface. Keeps its data elements sorted. Allows duplicate elements. Uses the LLNode class of the support package. Throws an exception if an iteration “walks off ” the end of the list. Throws an exception if an element is added when it is "full". Supports addition of elements at the front of the list, the end of the list, and anywhere in between. Can hold objects of any Java class. Has only O(1) operations, including its constructor. Provides more than one Iterator.
1. Use a below-given starter code. Use StackInterface.(h), and ArrayStack.(h,cpp). You will write your own StackDriver.cpp application file. IT'S IN C++Also...If the class that you create is Star, remember that you will declare your stack as follows:ArrayStack<Star> myStarStack;and you will push, pop, and peek Star objects.2. Create your own class definition. I should have at least one attribute, a constructor, and set and get methods for each attribute in your class.NOTE: If your class is offensive your lab will be rejected and you will receive a score of zero. I'm sorry I have to say this but there is a history of this happening and it is not appropriate.3. Write a driver program that exercises the Stack class from the downloaded starter code. Create multiple instances of your own class and demonstrate the stack operations: push, pop, and peek. ( you write your own class that you will put on the stack and you will write a driver that pushes, peeks, and pops your class items…
Create a class of type Generic so that it has a Get method that receive a list regardless of the type of this list. Print the list, remove the first and the last element in the list, reverse the list and finally print the list After modifications. Proposed methodologies:Generic Class. Technologies: - C#- Visual Studio
I'm trying to understand LargeIntList (Large Integers) classes for lists, I was wondering these statements or True or False? either or, can you please explain your answers? Thank you. Allows duplicate elements. Uses the LLNode class of the support package. Throws an exception if an iteration “walks off ” the end of the list. Throws an exception if an element is added when it is "full". Supports addition of elements at the front of the list, the end of the list, and anywhere in between. Can hold objects of any Java class. Has only O(1) operations, including its constructor. Provides more than one Iterator.
You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add(must be completed) to add nodes to this linked list. Your job is to complete the empty methods. For every method you have to complete, you are provided with a header, Do not modify those headers(method name, return type or parameters). You have to complete the body of the method. package chapter02;  public class LinkedList {  protected LLNode list;   public LinkedList()  {  list = null;  }   public void addFirst(T info)  {  LLNode node = new LLNode(info);  node.setLink(list);  list = node;  }   public void addLast(T info)  {  LLNode curr = list;   LLNode newNode = new LLNode(info);  if(curr == null)  {  list = newNode;  }  else  {  while(curr.getLink() !=…
EXPLAIN THE FLOW OF THE MAIN CODE (THE CODE IS ALREADY CORRECT YOU JUST NEED TO EXPLAIN THE FLOW) #include <iostream>#include "linkedlist.h" /** * This activity is focused on using Arrays and Linked Lists as two different * implementations of List. It follows that you are only to use the methods of * List and not of the specific array or linkedlist. */int main(void) { // WARNING! Do not modify this line up until line 22! // Doing so will nullify your score for this activity. // Also, do not create more instances of ArrayList or LinkedList // aside from those in lines 19 and 21. char li; cin >> li; List* list; if (li == 'A') { list = new ArrayList(); } else { list = new LinkedList(); } char sym; int arg1; int arg2; int count; int sum; // You may want to insert a loop here do{ cin >> sym; switch (sym) { case '?': cin >> arg1; cout << list->get(arg1)…
You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this homework. The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one…
Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linkedlist. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If nosuch element exists, output an appropriate message. Provide the definitions of these functions in the class linkedListType. Also writea program to test these functions. (Use either the classunorderedLinkedList or the class orderedLinkedList to testyour function.) Note: Code in c++
Question 1 If N represents the number of elements in the collection, then the add method of the SortedArrayCollection class is O(N). True False Question 2 If N represents the number of elements in the list, then the index-based remove method of the ABList class is O(N). True False Question 3 The add method of our Collection ADT might throw the CollectionOverflowException. True False Question 4 A list allows retrieval of information based on the size of the information. True False Question 5 Our CollectionInterface defines a single constructor. True False Question 6 Our lists allow null elements. True False Question 7 Even though our collections will be generic, our CollectionInterface is not generic. True False Question 8 Our lists are unbounded. True False Question 9 If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(N). True False Question 10 Our lists allow duplicate elements. True False
You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++, please read instructions carefully and new solution only! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then…
Question 20 A list is a collection with additional index- and iteration- related operations. True False Question 21 O(N) is the order of growth execution time of the size operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 22 If N represents the number of elements in the list, then the index-based set method of the ABList class is O(1). True False Question 23 O(N) is the order of growth execution time of the remove operation when using the LinkedCollection class, assuming a collection size of N. True False Question 24 It is not possible to use an array to implement a linked list. True False Question 25 O(N) is the order of growth execution time of the remove operation when using the ArrayCollection class, assuming a collection size of N. True False Question 26 Our linked implementation of lists implements a bounded list. True False Question 27 O(N) is the order of growth execution time of the contains operation…