Scala programming Serial Number: 500Name:c2.update ()c2.update ()What will happen when c1.get()+c2.get() is executed?A: Returns 40.B: Returns 4.C: Returns 22.D: Returns 0.E: Returns 44.Question 24: Consider the following code in Scala:val n = 3def createList (init: Int): List [Int] = {def aux (start: Int, count: Int): List [Int] = {if (count == 0) {Nil} else {start aux (start + 1, count - 1)}}aux (init, n)}val xs List [Int] = {val n = 5createList (2)}What will the value of xs be?A: List (2, 3, 4, 5, 6)B: List (2, 3, 4)C: List (2)D: List (2, 3, 4, 5)E: List (2, 3)Question 25: Consider the following Scala code (where... indicates omitted code):class Shape{...}class Triangle extends Shape {...}val shapes List [Shape] List (new Triangle, new Triangle) // (1)val trianglesList [Triangle] = shapes// (2)// (3)val shapes2: List [Shape] = trianglesWhich of the above lines of code are accepted by the Scala compiler when it typechecks the code? You shouldanswer for (2) based on the variable shapes having type List [Shape]. Similarly, you should answer for (3) basedon the variable triangles having type List [Triangle]. Name:A: (1) is accepted by the Scala compiler; (2) and (3) are not accepted.B: (1) and (3) are accepted by the Scala compiler; (2) is not acceptedC: (2) and (3) are accepted by the Scala compiler; (1) is not acceptedD: (1) and (2) are accepted by the Scala compiler; (3) is not acceptedE: (1), (2), and (3) is accepted by the Scala compilerQuestion 26: Consider the following Scala code:class A {def f() println ("A")}class B extends A {override def f () = System.out.println ("B")class C extends B {override def f () = System.out.println ("C").}val b: B = new C ()val a: Aba.f ()What happens when we try to execute this code?A: The code fails at runtime at the line val a: A = b because of a type errorB: B is printedC: C is printedD: The code fails to compile at the line val a: A b because of a type errorE: A is printedQuestion 27: Consider the Scala code:val q (x: Int) => { var y: Int = 0; y = y + x; y }What will happen when q(10) and then q (20) are executed?A: Returns 10 and 20 in that order.B: Returns 10 and 30 in that order.C: Returns 0 and 30 in that order.D: Returns 30 and 30 in that order.E: Returns 0 and 0 in that order.Question 28: Consider the Scala code:val q = List ( (x: Int) => x, (x: Int) => x + 1, (x: Int) => x + 2)What will happen when q.map (f => f (10)) is executed?A: Returns 33.Serial Number: 500

26. A is printed because a class is called refer opps concepts. E is the answer. 27. A is the answer…

(1), (2), and (3) is accepted by the Scala compiler Question 26: Consider the following Scala code: class A { def f (println ("A") } class B extends A { override def f () System.out.println ("B") } class C extends B { override def f ()= System.out.println ("C") } val b:B= new C () val a: A - b a.f () What happens when we try to execute this code? A: The code fails at runtime at the line val a: A b because of a type error B: B is printed C: C is printed D: The code fails to compile at the line val a: A =b because of a type error E: A is printed Question 27: Consider the Scala code: val q (x: Int) => { var y: Int=0; y = y + x; y } = What will happen when q(10) and then q (20) are executed? A: Returns 10 and 20 in that order. B: Returns 10 and 30 in that order. C: Returns 0 and 30 in that order. D: Returns 30 and 30 in that order. E: Returns 0 and 0 in that order.

(1), (2), and (3) is accepted by the Scala compiler Question 26: Consider the following Scala code: class A { def f (println ("A") } class B extends A { override def f () System.out.println ("B") } class C extends B { override def f ()= System.out.println ("C") } val b:B= new C () val a: A - b a.f () What happens when we try to execute this code? A: The code fails at runtime at the line val a: A b because of a type error B: B is printed C: C is printed D: The code fails to compile at the line val a: A =b because of a type error E: A is printed Question 27: Consider the Scala code: val q (x: Int) => { var y: Int=0; y = y + x; y } = What will happen when q(10) and then q (20) are executed? A: Returns 10 and 20 in that order. B: Returns 10 and 30 in that order. C: Returns 0 and 30 in that order. D: Returns 30 and 30 in that order. E: Returns 0 and 0 in that order.

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

DONT use any of the list methods (append, pop etc.). class mycircularqueue(): def __init__(self, m = 10): self.maxsize = m self.array = [None]*m self.FRONT = self.REAR = -1 def enqueue(self, item): # Inserts item at the rear of a non full queue and returns True. If unable to insert the item returns false ####################################################################### # Remove the pass statement and write your code ####################################################################### pass def dequeue(self): # Removes the item from the front of the queue and returns it. For unsuccessful dequeue return False ####################################################################### # Remove the pass statement and write your code ####################################################################### pass def peek(self): # Returns the…
C++ Quadratic Probing: You have a file called athletes.txt Jamie, basketball Justine, soccer Ned, badminton Shelley, hopscotch etc... The file contains 9 athletes. The user will specify the size of the hash table. Write a function that keeps track of the total number of collisions and searches into the hash table. Each index is assigned hash_index = i % table_size where "i" is an int in a for loop up to table_size If the table is full then: int t = (hash_index + i* i) % table_size; Display the number of collisions and searches.
this code gives me an error Traceback (most recent call last): File "main.py", line 2, in <module> from IntList import IntList File "/home/runner/local/submission/IntList.py", line 24, in <module> if new_node.data > current.next.data: NameError: name 'new_node' is not defined The original code given that can be edited is below class IntList: def __init__(self): self.head = None self.tail = None def append(self, new_node): if self.head == None: self.head = new_node self.tail = new_node else: self.tail.next = new_node new_node.prev = self.tail self.tail = new_node def prepend(self, new_node): if self.head == None: self.head = new_node self.tail = new_node else: new_node.next = self.head self.head.prev = new_node self.head = new_node def insert_after(self, current_node, new_node): if self.head is None:…
Please help me with this code becuase I dont think my output is correct. QUENEMAIN.CPP #include <iostream>#include <fstream>#include <cstdlib>#include <string>#include <stdexcept>#include <cassert>#include "LinkedQueue.h"using namespace std; /*** Name of input file containing officer names*/const char INPUT_FILE[] = "Alamo.csv";/*** Inputs data from a text file and places each officer's name into the* queue passed as a parameter.* @param officers - dynamic queue of Confederate officers in the Civil War*/void loadQueue(LinkedQueue<string> &officers); /*** Displays a list of officers removed from the queue and also displays* the name of the officer going for help. Retrieves officers from the * officers queue, one at a time, counting as each is retrieved. If the * count is not equal to hatNumber, the officer is put back into the* queue. When the count reaches hatNumber, that officer is removed from* the queue permanently (i.e., not put back…
class SLNode: """ Singly Linked List Node class DO NOT CHANGE THIS CLASS IN ANY WAY """ def __init__(self, value: object, next=None) -> None: self.value = value self.next = next from SLNode import *class SLLException(Exception): """ Custom exception class to be used by Singly Linked List DO NOT CHANGE THIS CLASS IN ANY WAY """ passclass LinkedList: def __init__(self, start_list=None) -> None: """ Initialize new linked list DO NOT CHANGE THIS METHOD IN ANY WAY """ self._head = SLNode(None) # populate SLL with initial values (if provided) # before using this feature, implement insert_back() method if start_list is not None: for value in start_list: self.insert_back(value) def __str__(self) -> str: """ Return content of singly linked list in human-readable form DO NOT CHANGE THIS METHOD IN ANY WAY """ out =…
Write a program that creates a linked list to represent details of students. The following details must be kept for each student: SID (for Student ID) Name Address Age Gender Your program must also display a menu to perform the following tasks: Create a linked list. Note: The method to create a linked list makes use of the method insertFirst() or insertLast() or insertOrdered() Insert new nodes to the linked list. Search for details pertaining to a particular student. Delete details of a particular student. Find number of nodes in the linked list. Display information pertaining to all students. The menu options should be as follows: Create linked list Add new student Search for a student Delete a student Find number of students Print student details Exit YOU SHOULD CREATE YOUR OWN NODE CLASS, AND YOU MUST NOT USE JAVA LINKED LIST LIBRARY.
0o.7. linked list, swap every two adjacent nodesand return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space.You may not modify the values in the list,only nodes itself can be changed."""class Node(object): def __init__(self, x): self.val = x.
please update generateRandoms, letterToGrades, sumBetween, countCharacters //A6Utilities.java import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.security.SecureRandom;import java.util.List;import java.util.TreeMap;import java.util.function.Function;import java.util.stream.Collectors;public class A6Utilities {/*** Returns the corresponding letter grade. Don't modify this method, simply use it when converting single* grades to their equivalent letter grade** @param grade the integer grade to convert* @return the letter grade equivalent to the integer grade*/private static char letterGrade(final int grade) {if (grade < 0) return '?';else if (grade < 60) return 'F';else if (grade < 70) return 'D';else if (grade < 80) return 'C';else if (grade < 90) return 'B';else if (grade <= 100) return 'A';else return '?';}/*** The method uses Java Streams only. Don't use any looping structures, conditional statements are OK (IF, TERNARY,…
3) in python Copy the Plain Text UTF-8 version of Bram Sroker’s Dracula from the site:http://www.gutenberg.org/ebooks/345 into a text document called ‘dracula.txt’. Write pythoncode that reads the text document and counts the unique words and stores the words and countsinto a dictionary. Write the words and counts into a text file called ‘dracula words.txt’ by usingthe Python file handle method seen in class. Generate a list called ‘sorted counts’ that containsthe value and key pairs as tuples that are sorted in descending order based on the frequencies ofthe words. For example, it should be in the form:[(7423, ‘the’),(5640, ‘and’),(4499, ‘I’),(4462, ‘to’),(3673, ‘of’),(2891, ‘a’),(2384, ‘in’),(ect.) Here, the word ‘the’ occurs the most frequently. Output the top 10 most frequently occurringwords. How often does the word ‘Dracula’ come up in the entire Novel?Hint: use list comprehension. For the dictionary ‘counts’ the command ‘counts.items()’ returns anobject of type dict items that…
how can i remove the spaces at the end of each line in my code ? code: def load_course(course_name):try:file = open(course_name+'.txt')return file.readlines()except FileNotFoundError as e:return None def word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) > lineWidth:lines.append(line)line = ''line += word + ' 'linelen = len(line)if line !='':lines.append(line)return '\n'.join(lines) def enhanced_word_wrap_text(text,lineWidth):words = list(text.split())linelen = 0lines = []line = ''for word in words:if linelen + len(word) + 1 > lineWidth:lines.append(line + word[:lineWidth-linelen])line = word[lineWidth-linelen:] + ' 'else:line += word + ' 'linelen = len(line)if line != '':lines.append(line)return '\n'.join(lines) lineWidth = int(input("")) while True:course = input("")if course == 'q':breaklines = load_course(course)if lines == None:print('Unable to load course information for course',course)else:for…
int F(node<int>&p){int c=0; while(p!=0){p=p->next; c++; } return c;} This function is a. return the number of items in the linked list b. return the number of items in a linked list and destroy the linked list c. None of these d. destroy the list and free all allocated nodes
In Python write a function that will play Rock, Paper, Scissors with itself. It will pick two random elements from a list. Then the function must know if random element #1 won, lost or drawed. The list is rps=[‘rock’, ‘paper’, ‘scissors’] Then the function must add to a dictionary the number of times the first element won per option in the list. Example{‘rock’:’400’, ‘paper’:’300’, ‘scissors’:’300’ } You need to run this at least 1000 times. You can either create a single thread, or you can create multiple threads. You need to use the random module and the random.choice(LISTNAME) to pick a random element from a list. Here's what I have so far: import random rps = ["rock", "paper", "scissors"] NumRock = 0 NumPaper = 0 NumScissors = 0 rand1 = random.choice(rps) rand2 = random.choice(rps) if rand1 == rand2: print("it's a tie") elif rand1 == "rock": if rand2 == "scissors": NumRock += 1…