Code in Haskell Programming only Space X is planning to start Star link. Programmers at SpaceX are having trouble to implement wildcard pattern matching supporting only the wildcard '?'. The wildcard character '?' can be substituted by any single lower case English letter for matching. He has two strings X and Y of equal length, made up of lower case letters and the character '?'. He wants to know whether the strings X and Y can be matched or not. The first line of input contain an integer T denoting the number of test cases. Each test case consists of two lines, the first line contains the string X and the second contains the string Y. For each test case, output a single line with the word Elon if the strings can be matched, otherwise output Musk. Input: 2 s?or? sco?? stor? sco?? Output: Elon Musk

Code in Haskell Programming only Space X is planning to start Star link. Programmers at SpaceX are having trouble to implement wildcard pattern matching supporting only the wildcard '?'. The wildcard character '?' can be substituted by any single lower case English letter for matching. He has two strings X and Y of equal length, made up of lower case letters and the character '?'. He wants to know whether the strings X and Y can be matched or not. The first line of input contain an integer T denoting the number of test cases. Each test case consists of two lines, the first line contains the string X and the second contains the string Y. For each test case, output a single line with the word Elon if the strings can be matched, otherwise output Musk. Input: 2 s?or? sco?? stor? sco?? Output: Elon Musk

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

In c++ and please without the use of vectors. Thanks very much! A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use linear search. Modify the algorithm to output the count of how many comparisons were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Joe 123-5432 Linda 983-4123…
please code in python MCQ are a very popular form of assessment because they can be automatically graded…and the students can choose an answer at random if they don’t know.The goal of this exercise is to write a function scoreMCQ(attempt, correct), where attempt is a string that contains the answers of the student and correct is a string with the correct answers.The function should return the number of correct answers.Check first that both strings have the same length, otherwise raise an exception.If both strings are empty the score should be 0 of course.To test your code, you can copy paste the following assert statements as your main function:assert(scoreMCQ("","")==0), "First test failed"assert(scoreMCQ("TFTF","TTTT")==2), "Second test failed"assert(scoreMCQ("TTTT","TTTT")==4), "Third test failed"assert(scoreMCQ("CCCC","ABCD")==1), "Fourth test failed"print("All tests succesfull")
Write a C++ program. Only use string, vector and iterator types from STL for solving these two problems. You can also use a math library. Q2: Design a game that mimics Wordle. Design the code by using functions as much as you can. You do not need to design a graphical interface as shown on the website. This assignment is about designing the underlying logic. Hardcode a set of valid dictionary words in your program. At the end of each try, you can output the text as shown in their example below (i.e., "The letter W is in the word and in the correct spot."): W EARY The letter W is in the word and in the correct spot. ILLS The letter I is in the word but in the wrong spot. V AGUE The letter U is not in the word in any spot.
Write a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.
All the problems are to be coded in Python/Java. You must explicitly solve each problem below using your own logic. For example, Do not use existing library functions, such as sum( ), which computes the sum of a list. Instead, you must use for/while loop to sum up the items in a list. a. Write code for a CharList class which converts a string to a linked list of characters in the string. * b. Add a class member function which outputs if the linked list in Problem a. is a palindrome. What is the Big-O upper bound? c. What change could be made to the class definition in Problem a. to make your solution in Problem b. more efficient? Explain. What is the Big-O upper bound? Hint: Think of how the palindrome determination problem is solved for a regular string. d. Add a method to the classic List class we discussed in class that reverses the list. That is, if the original list is A -> B ->C, all of the list's links should change so that C-> B-> A. Make your solution as efficient as possible.…
Could I get an example of a program writen in C that uses qsort() to sort its command line vector argv by the length of the strings? This is part of my first project and I don't understand pointers very well. If you have a video on how it is done that would work too. I looked at the meterial provided to me and I still cant rap my head around it. If this is to big of a question if you could baby step me through how pointers work that would be a great help. Thank you
Write a C++ program that stores a list of fruits enumerated in Fruits.txt in a STL list of strings. You need to solve the following problem: · output all the fruits in your STL list · output all fruits that start with letter smaller than ‘m’ · output all fruits that contain less than 6 character symbols · calculate the numeric sum of all letters in each fruit and store your answer in a histogram of length 10 where each element contains a value that is a multiple of 500(e.g. your histogram vector contains 10 values and each value represents the numeric value of each fruit (Note: the grand total of values in you histogram should be equal to the total number of fruits · take all the fruits in Fruits.txt and store the in a STL set<string> container · output all the (unique) fruits in Fruits.txt · output the total number of entries in your set Fruits.txt = {pina, naranja, melon, cereza, uva, ciruela, limon, frutabomba, aguacate, platano, manzana, fresa, lechuga, nuez, sandia, mango,…
I need help with this assignment, I need to make a struct to implement a limited Python style list in C++. When you bootstrap the exercise, you will be given a main.cpp file, with a simple program written in it. The program declares a Python style list and appends several elements to it, before printing it out to the terminal. The file is where I would setup my code #ifndef PY_LIST_H #define PY_LIST_H #include <iostream> struct PyList { // Declare your vars here PyList(){ // Implement this } void append(int x){ // Implement this } void append(char x){ // Implement this } void append(float x){ // Implement this } ~PyList(){ // Implement this } }; std::ostream& operator<<(std::ostream& os, const PyList& pyList){ os << '['; // Complete this implementation os << ']'; return os; } #endif Here is the main.cpp file that it must be able to run and the float must not have floating zeros #include <iostream> #include "PyList.h"…
I need to solve this in C++ code When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by subtracting the smallest value from all the values. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 30 50 10 70 65 the output is: 20 40 0 60 55 For coding simplicity, follow every output value by a space, even the last one. Your program must define and use the following function:int GetMinimumInt(vector<int> listInts) Note: This is a lab from a previous chapter that now requires the use of a function.
c++ Implement a recursive function that determines whether a string is a palindrome or not. A word is a palindrome if the word looks the same when written backwards. For example. kayak → kayak, but not ball → llob. The function only needs to handle whole words. No special characters or spaces appear in the strings. You do not have to deal with case sensitivity. You get a parameter from stdin: str the text string Input Expected outputkayak 1boll 0naturrutan 1