Take a string representing a directory path as a parameter And returns the number of directories in the path that have no files   def countSparseDirs(path):

The chapter is nested lists  Create code in python using for loops  Thanks!

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Python Big-O Notation/Time Complexity Pls answer only if u know big-o Thanks!  Item #3.

import java.lang.System; 3. public class FibonacciComparison { 4. // Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8 .... /* 7 input cases 8. 1) 0 9 2) 3 10 3) -1 11 4) 9 12 output cases 13 1) 0 14 2) 2 15 3) 0 16 4) 34 17 */ // Note that you need to return 0 if the input is negative. // Please pay close attention to the fact that the first index in our fib sequence is 0. 18 19 20 // Recursive Fibonacci public static int fib(int n) { // Code this func. 21 22 23 24 return -1; 25 26 // Iterative Fibonacci 27 28 public static int fiblinear(int n) { // Code this func. 29 30 return -1; 31 32 33 public static void main(String[] args) { 34 // list of fibonacci sequence numbers int[] nlist w { 5,10, 15, 20, 25, 30, 35, 40, 45}; 35 36 37 // Two arrays (one for fibLinear, other for fibRecursive) to store time for each run. // There are a total of nlist.length inputs that we will test double[] timingsEF = new double[nlist.Length]; double[] timingsLF = new double[nlist.length]; 38 39 40 41 42 // Every…

Java Task Write a for loop that prints the characters stored in a String object backward. The String is entered by the user.  ***Use ch = phrase.charAt(i); to get the character that is in index i of the String phrase.**** For example The user enters “Good morning!” The printout should be “!gninrom dooG”.

C Programming Language Task: Deviation Write a program that prompts the user to enter N numbers and calculates which of the numbers has the largest deviation from the average of all numbers. You program should first prompt the user to enter how many numbers that will specify. The program should then scan for each number, separated by a newline. You should calculate the average value and return the number from the list which is furthest away from this average (to 2dp). Try using dynamic memory functions to store the incoming array of numbers on the heap. Code to build from: + 1 #include 2 #include 3 4 int main(void) { 5 6} 7 Output Example: deviation.c How many numbers? 5 Enter them: 1.0 2.0 6.0 3.0 4.0 Average: 3.20 Largest deviation from average: 6.00

***python only*** Write a program that prompts the user for floating-point numbers until the user enters the word 'end' all by itself. The program should store the user-entered numbers in a list.The program will then randomly select half of those numbers and print these numbers (separated by a blank space). Hint: use a random number generator to make the randomselection.