solve all or dont solve single plz use python 5.1 Create two lists from the table below.ProgrammingLanguage/Year20211151228703328017FortranJavaPythonR5733Scala13065C90268C# 102178C++ 168453# Numeric List 1151,228783...* String List Fortran, Java, ....5.2 Reassign 'R' in this above list with HTML and print it.5.3 Arrange the Numeric list in desending order.5.4 Insert 'CSS' at index 3 in String List5.5 Find the index of the "Scala" from String list.

Ans 5.1 Python Code- #creating 2 list from the…

5.1 Create two lists from the table below. Programming Language/Year Fortran Java Python R Scala с C# C++ 2021 1151 228703 328017 5733 13065 90268 102178 168453 #Numeric List 1151,228703... String List Fortran, Java, 5.2 Reassign 'R' in this above list with HTML and print it. 5.3 Arrange the Numeric list in desending order. 5.4 Insert 'CSS' at index 3 in String List 5.5 Find the index of the "Scala" from String list.

5.1 Create two lists from the table below. Programming Language/Year Fortran Java Python R Scala с C# C++ 2021 1151 228703 328017 5733 13065 90268 102178 168453 #Numeric List 1151,228703... String List Fortran, Java, 5.2 Reassign 'R' in this above list with HTML and print it. 5.3 Arrange the Numeric list in desending order. 5.4 Insert 'CSS' at index 3 in String List 5.5 Find the index of the "Scala" from String list.

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

Please fill in the blanks for C, from 1 to 68. /*The program will get the information of each client and print it right back. We could get the information of all clients first, then print them all later for better readability using an array of struct.*/ #include<stdio.h> #include<stdbool.h> #define length 70 //assume there's no names longer than 70 /*It's good practice to add all function headers to the top of the program*/ __1__ __2__ getEmployeeInfo(); __3__ printEmployeeInfo(__4__ __5__ em); __6__ __7__ getClientInfo(__8__ i); __9__ printClientInfo(__10__ __11__ cli, __12__ i); /*Employee struct: all the arrays use the same constant size defined on top name-first, last-(string) title (string) number of clients (integer) number of years working at the company(can take decimal points). */ __13__ employee { __14__ first_name[__15__]; __16__ last_name[__17__]; __18__ title[__19__]; __20__ num_clients; __21__…
Write two Lisp functions using memory allocation methods 1. The first function should return the first element in the list that is larger than or equal to the value. For example,(first-fit '(3 8 6 4 9) 5)should return 8. The second should return the element of the list that best fits the value. Look for the smallest value in the list that is larger than or equal to the value. Do not use the built-in function sort, nor sort the list in some other way. The solution should be linear For example,(best-fit '(3 8 6 4 9) 5)should return 6.
2. Write a program in 'C' language that implements a list using array. The elements of the list are strings. Do the following operations : Add the strings "red", "blue", "oránge", "black" and "green" in positions 1, 2, 3, 4 and 5, respectively. (a) (b) Insert "yellow" at the first position. (c) Insert "purple" at the fourth position. (d) Remove "orange" from the list. (e) Print all the elements in list in the order in which they are stored.
Please fill in the blanks. Programing language is C. /*For simplicity, this program will get the information of each client, and print it right back. We could get the information of all clients first, then print them all later for better readability using an array of struct.*/ #include<stdio.h> #include<stdbool.h> #define length 70 //assume there's no names longer than 70 /*It's good practice to add all function headers to the top of the program*/ __1__ __2__ getEmployeeInfo(); __3__ printEmployeeInfo(__4__ __5__ em); __6__ __7__ getClientInfo(__8__ i); __9__ printClientInfo(__10__ __11__ cli, __12__ i); /*Employee struct: all the arrays use the same constant size defined on top name-first, last-(string) title (string) number of clients (integer) number of years working at the company(can take decimal points). */ __13__ employee { __14__ first_name[__15__]; __16__ last_name[__17__]; __18__ title[__19__]; __20__ num_clients;…
PYTHON 3 def get_total_grade(info_list, show_steps = False): """ param: info_list - a list that contains dictionaries param: show_steps - a Boolean flag (False by default) controls whether the function outputs intermediate steps, outputting the average scores. Each dictionary in the info_list is supposed to have the following string keys: - category - the name of each grade category (string) - weight - the percentage weight of the category (float) - grades - a list of numeric grades for each assignment If no grades are stored for a category, the "grades" item will store an empty list. return: The function returns a floating-point value that results from summing up the product of the weight of each category with the average value of each "grades" list. The function returns 0 if the info_list is empty. Helper functions: The function calls the following helper functions: - get_grades() to extract the grades…
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
Q 5. Write a program in C++ using object oriented concepts to input a list of numbers in an array and then rearrange this array in such a way that all the odd numbers appear in the beginning of the array and all the even numbers appear in the end of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be: 1,5,7,9,2,4,6. [3]
Write C++ program binary searching for search value in array list and display its position on the screen? Write C++ program sequential searching for search value in array list that consist of 5 elements and display its position on the screen?
Read this: Complete the code in Visual Studio using C++ Programming Language - Give me the answer in Visual Studio so I can copy*** - Separate the files such as .cpp, .h, or .main if any! 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…
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…
Write a class that maintains the top 10 scores for a game application, implementthe add and remove functions. use a singlylinked list instead of an array. C++ C++ C++
C++ Please explain the code below. It doesn't have to be long, as long as you explain what the important parts of the code do. You can also explain it line by line for best ratings. Thank you so much! #include "list.h"#include <cstdlib>#include <iostream>#include <cmath>using namespace std;class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return…