Only 2a please 4:03 Ob. Using Data Encapsulation in Python, give the output of the Pseudocode below:E=====--===============:===-----=====---==============-=======-===-=class Computer:def init (self):self._maxprice = 900def sell(self):print("Selling Price: 0".format(self._maxprice))def setMaxPrice(self, price):self._maxprice = pricec = Computer()C.sell)# change the priceC._maxprice = 1000C.sello# using setter functionC.setMaxPrice(1000)c.sell()2a. Create a Class called Country, with Attributes : Name, Size and Location,and the Behaviors as Depopulate and Develop,b. Differentiate between Encapsulation, Inheritance and Polymorphism.II

Answered: 2a. Create a Class called Country; with…

2a. Create a Class called Country; with Attributes : Name, Size and Location, and the Behaviors as Depopulate and Develop,

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

Translate C program to Pep/9 assembly language. /C code for 6.19a#include <stdio.h>char myChar;char toLower(char ch) { if ((ch >= ’A’) && (ch <= ’Z’)) { return ch + ’a’ - ’A’; } else { return ch; }}int main () { scanf(”%c”, &myChar); printf(”%c\n”, toLower(myChar)); return 0;}
SumDouble.java [1 13 14 14 27 28 * Logic problem for CS 170. @author * @version */ public class SumDouble /** * Complete the function sumDouble(). * Given two int values, return their sum. * Unless the two values are the same; * then return double their sum. * Some examples sumDouble (1, 2) returns 3 sumDouble (3, 2) returns 5 sumDouble (2, 2) returns 8 @param a is the first int value. * @param b is the second int value. * @return their sum or double their sum if equal. */ public int sumDouble(int a, int b) { // Complete the sumDouble method here.
C. Using the starter code please modify in Java public class L08 { public static void main(String[] args) { // TO DO: // Test your radix sort implementation here } // TO DO: // Implement // NOTE: You can assume that all strings in the array have the same length public static void radixSort(String[] array) { } //////* HELPER METHODS *////// private static String[] generateStringArray(int wordLen, int arrLen) { String[] array = new String[arrLen]; for(int i = 0; i < arrLen; i++) { StringBuilder sb = new StringBuilder(); for(int j = 0; j < wordLen; j++) { sb.append((char)('a' + Math.random() * ('z' - 'a' + 1))); } array[i] = sb.toString(); } return array; } private static void displayStringArray (String[] array) { for(String s : array) { System.out.println(s); } } private static boolean isSortedInNondescendingOrder(String[] array) { for(int i = 1; i < array.length; i++) { if (array[i].compareTo(array[i-1]) < 0) { return false; } } return true; } } Implement radix sort for…
C++ Language: write code. and algorithm or related theory of the following question. Give secreenshoots. Narrative 2: We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number…
12.14 Zylab 3 - Single Procedure Call Given an array of at least one integer, write a program to create a new array with elements equal to the power of each element in the original array raised to the index, i.e., P[i] = A[i]^i. For this, write two functions that will be called in main function independently. ● power inputs: element (A[i]) and index (1) • task: returns the value of element raised to index (A[i]^i). } O • newElement inputs: base address of new array P (*P), current size of P (variable k) and the new element (A[i]^i) o task: add the new element at the end. o This function does not return any value (void). O Following is a sample C code to perform the required task. You may modify the code for the functions, but the task performed should not be changed. int main() { // Variable Declaration int *A, *P; int n, k; int pow; // Task of main function P[0] 1; for (int j = k = j; pow // Base addresses of A and P // Lengths of arrays A and B // Return value from power function }…
Implement in C Programming 7.9.1: LAB: BankAccount struct Given main(), build a struct called BankAccount that manages checking and savings accounts. The struct has three data members: a customer name (string), the customer's savings account balance (double), and the customer's checking account balance (double). Assume customer name has a maximum length of 20. Implement the BankAccount struct and related function declarations in BankAccount.h, and implement the related function definitions in BankAccount.c as listed below: BankAccount InitBankAccount(char* newName, double amt1, double amt2) - set the customer name to parameter newName, set the checking account balance to parameter amt1 and set the savings account balance to parameter amt2. (amt stands for amount) BankAccount SetName(char* newName, BankAccount account) - set the customer name void GetName(char* customerName, BankAccount account) - return the customer name in customerName BankAccount SetChecking(double amt, BankAccount…
Dijkstra's algorithm Weight Class Implementationlanguage : C++ Note : Skelton Files Provided Please check the linksproject Details:https://ece.uwaterloo.ca/~dwharder/aads/Projects/5/Dijkstra/ Files:https://ece.uwaterloo.ca/~dwharder/aads/Projects/5/Dijkstra/src/ Please provide clear and complete solution for thumps up.
please code in python Forbidden concepts: recursion, custom classes Create a program that asks for a person’s name and sex (male, female, or other). Use a killswitch to see when the user is done entering everyone. Once completed, the program must print out all the male names, then female names, and then the others.
Course: Reconfigurable Computing (Using Vivado ML Edition or Previous Version) Lab requirements: 1) Implement a 2-D convolution using HLS C. 2) Optimize the HLS with directives. Kindly provode the Source code + Experimental report.
Please use Python for this question: Inheritance (based on 8.38) You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. Implement a Stack class using Note that this means you may be able to inherit some of the methods below. Which ones? (Try not writing those and see if it works!) Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. push() – take an item as input and push it on the top of the stack pop() – remove and return the item at the top of the stack isEmpty() – returns True if the stack is empty, False otherwise [] – return the item at a given location, [0] is at…
T/F An object is a sort of active data type() win = Graph Win() must be used after adding the following instruction import graphics() r = Rectangle(Point(20,20), Point(40,40)) represents a class() Oval(Point(50,50), Point(60,100)) is a constructor definition
main.cpp:4:17: error: 'string' has not been declared 4 | void KMPSearch(string pat, string txt) main.cpp:4:29: error: string' has not been declared 4 | void KMPSearch(string pat, string txt) Aununun main.cpp:31:25: error: string' has not been declared 31 | void computelPSArray(string pat, int M, int[] lps) main.cpp:31:50: error: expected or . before lps' 31 | void computeLlPSArray(string pat, int M, int[] lps) main.cpp:55:8: error: expected :' before 'static' 55 | public static void Main() main.cpp:61:2: error: expected ;' after class definition 61 | } | main.cpp: In member function 'void GFG::KMPSearch(int, int)': main.cpp:6:15: error: request for member Length' in 'pat', which is of non-class type 'int' 6 | int M = pat.Length; main.cpp:7:15: error: request for member Length' in txt’, which is of non-class type 'int' int N = txt.Length; main.cpp:8:6: warning: structured bindings only available with -std3c++17' or (-std=gnu++17' 8 | int[] lps new int[M];