Fill in the blanks : The output of ls dir* is ______.

* Assignment: Longest increasing subsequence  *  * Sequences are a natural source of computational problems. One such  * family of problems involves finding subsequences with specified  * properties in a given sequence. This exercise asks you to write  * a program that, given a sequence  *  *   s(0), s(1), ..., s(n-1)  *  * of integers as input, finds a ___longest increasing subsequence___  * of the sequence s.  *  * For example, suppose we are given as input the sequence  *  *    72, 16, 51, 17, 6, 21, 92, 59, 54, 78, 41, 33, 94,  *        85, 83, 56, 2, 46, 57, 44, 73, 6, 47, 47, 0.  *  * In this sequence, a longest increasing subsequence has length 7.  * One example of such an increasing subsequence is  *  *    16 < 17 < 21 < 54 < 56 < 57 < 73.  *  * More generally, your program must be such that  * given a sequence  *  *   s(0), s(1), ..., s(n-1)  *  * of integers as input, the program returns a subsequence  *  *   s(i_1), s(i_2), ..., s(i_k)  *  * that meets all…

C++

Write code in C++ There are two scientists working on set of numbers. The first person is looking for two numbersspecifically. The second person is responsible for entering all data. Help the first person to know ifthe numbers set entered by the second person includes the two numbers he is looking for!InputThe first person shall enter two numbers. The second person enters set of numbers of any size. S/hecan enter any range of numbers (up to you how to read those numbers).OutputMessage showing if both numbers entered by the first person have been found or not. If one of thenumbers was found show which one has been found. Hint: you may need to use flag-controlled loop.

Please fill in the blanks for C. /* Part 1 will count how many times a character appears in a sentence. Part 2 will remove the character of interest from the sentence. Note: I also use different typs of loop to show it doesnt have to be the same type of loop everytime. */ __1__<__2__> //add the library to use printf and scanf functions __3__<__4__> //add the library to use boolean #__5__ LEN 1000 //create a constant max LEN   // Add function headers __6__ search_char(__7__ c1, __8__ c2); __9__ get_occurrences(__10__ str[], __11__ search); __12__ scan_string(__13__ str[]); __14__ remove_char_from_str(__15__ s1[], __16__ s2[], __17__ search);   //PART 1 + 2 /*This function returns an integer 1 is the two character are the same     and 0 otherwise.   Normally, we returns -1 if they are not the same, but in this case,     this number will be added to the counts from get_occrrences function     to return the number of times a character appears for Part 1. */ __18__…

part 1) Write a generator expression G that produces the sequence of positive integers k in therange 1 < k < 100 such that k is not divisible by 7.   Part2) Write a Python function called not_divisible by (d, n) that takes as input two positiveintegers d and n, and returns a generator object producing th: sequence of positive integers k in therange 1 ≤ k < n such that k is not divisible by d

公 * 00 9. Write the has_same_words_count user defined function, call it, and print out the results: has_same_words_count function has two input parameters from data type String, and it returns true if the two strings have the same number of the words, or returns false otherwise. Example 1: str1%3D' How are you?' str2= ' We are good.' comp = has_same_words_count(str1, str2) will print True. Example 2 str1='How are you? str3=' Welcome to CSCI 111 class' comp = has_same_words_count(str1, str3) %3D print(comp) will print the value False. print(comp) MacBook Air 000 O00 DD F3 F4 F5 F6 F8 V #3 $ 6

Help and show me fix an error problem? def decorator(decorated_function:callable): def wrapper_function(*args, **kwargs): #this is where we make modifications to the arguments before invoking the decorated function return_value = decorated_function(*args, **kwargs) #this is where we make modifications to the returned value after invoking the decorated function return return_value return wrapper_function   def reverse_decorator(function:callable): This question is meant to test your knowledge of creating a decorator to decorate a function that accepts no arguments and alters the decorated function's output. This decorator will decorate a function that only returns strings and has no arguments. This decorator should reverse the string value returned by the decorated function and return the reversed string. In other words, if a function is decorated by this decorator all of the functional output should be the reverse of its normal output.  def…

Kindly fix the code:

in c++