[CC1-3]What should be written in Q3? (computeTrainCost, condition 1)if (fDistance < 5)if (fCost < 5)O if (fDistance >= 5)O if (fDistance > 5) Code:12345678910111213141516171819202122232432333435363738394041 E42434445464748495051#include 525354555657float computeBusCost (float fDistance) {float fCost;if (??[Q1]??) // 1) computeBusCost, condition 1fCost 15.5 * fDistance;??[Q2]?? // 2) computeBusCost, conditional constructfCost 275.0;return fCost;}float computeTrainCost(float fDistance) {float fCost;if (??[Q3]??) // 3) computeTrainCost, condition 1fCost = 200.00;25}2627 int main() {28293031else if (fDistance15)??[04]?? // 4) compute TrainCost, fare calculation 2??[05]?? // 5) compute TrainCost, conditional constructfCost 550.8;return fCost;float fBalance, fDistanceBus, fDistanceTrain;float fBusCost = 0, fTrainCost = 0;printf("Enter Balance: ");scanf("%f", &fBalance);printf("Enter Distance (in km) that you will travel via Bus: ");scanf("%f", &fDistanceBus);printf("Enter Distance (in km) that you will travel via Train: ");scanf("%f", &fDistance Train);if (??[Q6]??) { // 6) invalid input conditionprintf("Invalid Input!");}else {fBusCost = ??[Q7]??; // 7) bus cost calculationfTrainCost = ??[08]??; // 8) train cost calculationprintf("Total Bus Fare will be PHP %.2f\n", fBusCost);printf("Total Train Fare will be PHP %.2f\n", fTrainCost);if (??[09]??) { // 9) check if user can afford conditionprintf("You do not have enough balance.");else {printf("You have enough balance.");return 0;

C program: C is a general purpose programming language. It was developed by Dennis Ritchie in the…

Answered: What should be written in Q3?…

What should be written in Q3? (computeTrainCost, condition 1) if (fDistance < 5) if (fCost < 5) O if (fDistance >= 5) if (fDistance > 5)

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

Use C++ Programming language. The header file below defines a class for a simple hash table: hashMap.h Download hashMap.h Write a driver program to test the class with the following data: (520, "3100 Main St, Houston TX "); (37, "2200 Hayes Rd, Austin TX"); (226, "1775 West Airport St, San Antonio TX"); (273, "3322 Walnut Bend, Houston TX"); (491, "5778 Alabama, Waco TX"); (94, "3333 New St, Paris TX"); Make sure to test the find function for exiting and non-existing data 2. Modify the type of member key in class HashEntry from int to a string (this is useful is the key is e.g. the phone number or e-mail address). Use the string hash function discussed in class (see ppt notes) or search online for alternative functions that work on strings. 3. Modify the collision strategy of class HashMap to do separate chaining instead of linear probing. Be sure to modify the display function so that items in the bucket chains are also displayed in a pre-defined order…
AVA PROGRAM ASAP Please modify this program ASAP BECAUSE it does not pass all the test caseswhen I upload it to hypergrade. Its says 0 out of 3 passed when i upload it to hypergrade. The program must pass the test case when uploaded to Hypergrade. import java.util.HashMap;import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.Scanner;public class MorseCodeConverter { private static HashMap<Character, String> morseMap = new HashMap<>(); public static void main(String[] args) { loadMorseCodes(); Scanner scanner = new Scanner(System.in); System.out.println("Please enter a string to convert to Morse code:"); String input = scanner.nextLine().toUpperCase(); String morseCode = convertToMorse(input); System.out.println(morseCode); } private static void loadMorseCodes() { try (BufferedReader reader = new BufferedReader(new FileReader("morse.txt"))) { String line;…
function myChoice(items) {if (!this.value && !this.items) {this.items = items[0];} else if (!this.value || (params.length > 0 && params[0] == "rechoose")) {let index = Math.floor(Math.random() * (this.items.length - 0)) + 0;this.value = this.items[index];return this.value;}return this.value;} var a = myChoice([1, "a", 3, false]);console.log(myChoice(3, 12));console.log(myChoice(51, -2));console.log(myChoice("happy", false));console.log(myChoice([1, 2, 3]));console.log(myChoice("rechoose"));console.log(myChoice(a, a)); these are directions and examples myChoice( items ) This function accepts a list of items as input and creates a function that returns a randomly-chosen item. After choosing a random item, that same item will be always be returned, regardless of the functions input, with one exception. If the first input is the string 'rechoose', then a new random item will be chosen and therafter returned. this is KEYYYY!! Examples var a = myChoice( [1, "a", 3, false]…
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:…
Stack CreateStack(S) push (S, 10) push (S, 15) push (S, 20) x = top (S) push (S, x + 5) x = pop (S) + top (S) push (S, x – pop (S)) push (S, pop (pop (S))) push (S, x – top (S)) push (S, push(S, x) – top (S)) After executing the given codes above, answer the questions and explain. Thanks
USE the Node, StackArray, StackRef and Stack interface classes PROVIDED BELOW to create code that reads input from the sample Data File PROVIDED to solve PLEASE READ DIRECTIONs VERY CAREFULLY please answer in full here and thanks for your help Data File2 3 4 + +12 6 / 4 * 4 +2 2 3 3 * * *7 5 / 5 + 17 -4 3 - 5 6 + 4 * -1 1 + 3 * 4 - 10 ^ public class Node <T>{ private T data; private Node<T> next; public Node(T data, Node<T> next) { this.data = data; this.next = next; } public T getData() { return data; } public Node<T> getNext() { return next; } } import java.util.Stack; public class StackArray<T> implements Stack<T> { private T [] elements; private int top; private int size; public StackArray (int size) { elements = (T[]) new Object[size]; top = -1; this.size = size; } public boolean empty() { return top == -1;…
what is the problem in the display function ? the code : #include <iostream>using namespace std; class node{public: int data; node* next;}; void display(node * head) // printing the data of the nodes{ node* temp = head; while (temp != NULL) { cout << temp->data << endl; temp = temp->next; }} // add void push(node** head, int newdata) // { 5, 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = *head; *head = newnode;} void append(node** head, int newdata) // { 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = NULL; node* last = *head; if (*head == NULL) { *head = newnode; return; } while (last->next != NULL) { last = last->next; } last->next = newnode;} void insertafter(node*…
java quetion Write a generic AddressBook<E extends Person> class that manages a collection ofPerson objects. The AddressBook class is a generic class limited to person objects. Forexample, once you instantiate an AdressBook of Student objects, you cannot add anyother type of person objects into that instance of address book.The AddressBook should have methods to add, delete, or search for a Person objects inthe address book.• The add method should add a person object to the address book. Make sure thatthe add method does not add duplicate person objects to the address book.• The delete method should remove the specified person object from the addressbook.• The search method that searches the address book for a specified person andreturns the list of persons matching the specified criteria. The search can be doneeither by first name, last name, or person id.Write an AddressBookTester class to test your class.
Please code in C language. Please use the starter code to help you solve the deleted node and the reverse list. Here is the starter code: #include <stdio.h> #include <ctype.h> #include <stdlib.h> #include <string.h> #include "linkedlist.h" // print an error message by an error number, and return // the function does not exit from the program // the function does not return a value void error_message(enum ErrorNumber errno) { char *messages[] = { "OK", "Memory allocaton failed.", "Deleting a node is not supported.", "The number is not on the list.", "Sorting is not supported.", "Reversing is not supported.", "Token is too long.", "A number should be specified after character d, a, or p.", "Token is not recognized.", "Invalid error number."}; if (errno < 0 || errno > ERR_END) errno = ERR_END; printf("linkedlist: %s\n", messages[errno]); } node *new_node(int v) { node *p =…
for (String name : likedBy) { String likedUser= name.trim(); Set<String> likes = likesMap.getOrDefault(likedUser, new HashSet<>()); Here you create a new Set for likes. This is in the iteration over the likers though so it results in many missing entries. [ How do i Fix this ] import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.Set; public class FacebookLikeManager { private Map<String, Set<String>> likesMap; public FacebookLikeManager() { likesMap = new HashMap<>(); } public void buildMap(String filePath) { try (BufferedReader reader = new BufferedReader(new FileReader(filePath))) { String line = reader.readLine(); while (line != null) { String[]…
An array may contain multiple duplicate values, as shown below. In order to design an algorithm with the best average performance to remove all duplicate values, which of the following data structures should be used? 110, 1100, s, 10, s6, s, 96, 34, s, 34, 20, 110, 30 Question 16 options: hash table stack list priority queue
USE the Node, StackArray, StackRef and Stack interface classes PROVIDED BELOW to create code that reads input from the sample Data File PROVIDED to solve PLEASE READ DIRECTIONs VERY CAREFULLY thanks for your help Data File2 3 4 + +12 6 / 4 * 4 +2 2 3 3 * * *7 5 / 5 + 17 -4 3 - 5 6 + 4 * -1 1 + 3 * 4 - 10 ^ public class Node <T>{ private T data; private Node<T> next; public Node(T data, Node<T> next) { this.data = data; this.next = next; } public T getData() { return data; } public Node<T> getNext() { return next; } } import java.util.Stack; public class StackArray<T> implements Stack<T> { private T [] elements; private int top; private int size; public StackArray (int size) { elements = (T[]) new Object[size]; top = -1; this.size = size; } public boolean empty() { return top == -1; } public boolean…