1. Classrepresents a dynamically resizable array-like data structure.a. Stackb. LinkedListс. АrrayListd. Array2. A(n)is a data structure with a fixed size and can be direct access itselements.a. Vectorb. ArrayListc. LinkedListd. Array3. A(n)is a data structure in which objects are inserted into and removedfrom the same end.a. LinkedListb. ArrayListc. Stackd. Queue4. A(n)is a data structure in which objects are inserted into the end andremoved from the front.a. LinkedListb. ArrayListc. Stackd. Queue

Answered: 1. Class represents a dynamically…

Engineering

Computer Science

1. Class represents a dynamically resizable array-like data structure. a. Stack b. LinkedList с. ArrayList d. Array

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 3RP

See similar textbooks

Similar questions

Create a list – l1 with element 1,2,3,4,5. Convert this list into an array name ar. What is the dimension of this array – one dimension, 2 dimension or multidimension What is the datatype of elements of array. Print the second element of an array. Create a nested list – l2 with three lists. Elements of each lists are – [1,2,3];[4,5,6];[7,8,9] Convert this list into an array ar2. What is the dimension of this array. Observe the parenthesis. Print 8 from this array. Without using list, create an array ar3, which has the even number from 2 -10. Use the np.arange(start, end, skip). Run the following code and observe the output.
Design a class that acquires the JSON string from question #1 and converts it to a class data member dictionary. Your class produces data sorted by key or value but not both. Provide searching by key capabilities to your class. Provide string functionality to convert the dictionary back into a JSON string. question #1: import requestsfrom bs4 import BeautifulSoupimport json class WebScraping: def __init__(self,url): self.url = url self.response = requests.get(self.url) self.soup = BeautifulSoup(self.response.text, 'html.parser') def extract_data(self): data = [] lines = self.response.text.splitlines()[57:] # Skip the first 57 lines for line in lines: if line.startswith('#'): # Skip comment lines continue values = line.split() row = { 'year': int(values[0]), 'month': int(values[1]), 'decimal_date': float(values[2]),…
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…
i) Create a Node class which will hold two fields i.e an integer element and a reference to the next Node. ii) Create a Linked list Abstract Data Type (ADT)named MyList.The elements in the list are Nodes consisting of an integer type key (all keys are unique) and a reference to the next node. [You are not allowed to use any global variable other than head] If you are using PYTHON, make sure your code has the methods invoked through test statements and proper printing statements according to the tasks. You may create a separate Tester class for this or test the methods within the MyList class. Write a code in python
Which of the following data structures store values in contiguous memory? Check all that apply . Vector Linked List Dynamic Array Map Array
m6 lb Dont copy previous answers they are incorrect. Please provide a typed code and not pictures. The template was given below the code. we are just making changes to main cpp. We are writing one line of code based on the comments. C++ use shared pointers to objects, create vectors of shared pointers to objects and pass these as parameters. You need to write one line of code. Declare circleTwoPtr. Watch for **** in comments. Template code is given make changes and add stuff based on comments: Template given: main.cpp: #include<iostream>#include "Circle.h"#include <fstream>#include <vector>#include <memory>#include<cstdlib>#include <fstream>#include <sstream>using namespace std;const int SIZE = 10;// pay attention to this parameter listint inputData(vector<shared_ptr<Circle>> &circlePointerArray, string filename) { ifstream inputFile(filename); istringstream instream; string data; int count =0; int x,y,radius; try{ if…
Give me the answer in one Visual Studio file, not Visual Studio Code - Give me full code near and simple Develop a C++ "doubly" linked list class of your own that can hold a series of signed shorts Develop the following functionality: Develop a linked list node struct/class You can use it as a subclass like in the book (Class contained inside a class) You can use it as its own separate class Your choice Maintain a private pointer to a node class pointer (head) Constructor Initialize head pointer to null Destructor Make sure to properly delete every node in your linked list push_front(value) Insert the value at the front of the linked list pop_front() Remove the node at the front of the linked list If empty, this is a no operation operator << Display the contents of the linked list just like you would print a character string operator [] Treat like an array Return the value stored in that element of the linked list If element doesn’t exist, return…
How is a map different from other Java data structures? A Each data element connects to the next element in the map. B It's a data structure that stores data pairs: keys and their associated values. C Each data element can connect to multiple related elements in a map. D It's a data structure that keeps its data sorted.
Create a program (or set of programs) which accomplish the following for each complex data type (list,tuple,set,frozenset, dictionary): create the item with at least 4 elements Append an element Remove an element Insert an element in the middle somewhere Append another array of the same data type Append another array of a different data type (for example, if you have a dictionary, append a set or tuples And do the following: Output the results after each step. Report and explain any errors (if a line of code generates an error, comment it out along with a comment on what the error was and your reasons for that error) Create a range of negative numbers Create a range of positive even numbers Insert a range into each data type that would allow it Please explain each error you ran into
1. a JFrame objects content panel is a(n)________ of type _________ A. object; container B. object; JPanel C. primitive; int D. primitive; double E. none of the above 2. You have a large array that you want to be sorted In ascending order. Under what circumstances would the bubblesort algorithm sort that array very quickly? A. if the array is initially in descending order B. if the array elements can be mapped to a linked list C. if the array elements are already close to their eventual sorted position D. if the array elements are string objects E. never, heapsort will always be faster
Select all of the applicable choices. In which of the following situations is a vector more efficient than a list? O A program that needs to add a significant number of items to the container's beginning O A program that often accesses elements throughout the container O A program that adds a certain amount of elements and then repeatedly removes the initial element O A program that adds elements regularly, but only to the container's end
#include <bits/stdc++.h>#include<unordered_map>#include <string> using namespace std; struct Student{string firstName;string lastName;string studentId;double gpa;}; class MyClass{public:unordered_map<string, int>classHoursInfo;vector<Student> students;unordered_map<string, int> creditValue = {{"A", 4}, {"B", 3}, {"C", 2}, {"D", 1}, {"F", 0}}; void readStudentData(string filepath){cout << "reading student data \n";ifstream inpStream(filepath);string text;string tmp[4];while (getline (inpStream, text)) {string str = "", prevKey = ""; int j= 0;unordered_map<string, int> curStudentClassInfo;for(int i=0; i<text.length(); i++){if(isspace(text[i])){if(j>3){if(prevKey.length()==0){curStudentClassInfo[str] = 0;prevKey = str;str.clear();}else{curStudentClassInfo[prevKey] = creditValue[str];prevKey = "";str.clear();}}else{tmp[j++] = str;str.clear();}}else{str = str+text[i];}}if(str.length() != 0){curStudentClassInfo[prevKey] =…