How many comparisons are made by the brute-force string-matching algorithm in searching for the pattern "00111" in the binary text of 2000 zeros?

Consider the code fragment below n = 1; k = n-255; if (n + 1 == k) printf("n = %d\n",n); If this code printsn = 1, what is the type of k?

How many strings of letters from the set {A, B, C} have length 11 and have exactly 4 A's (repeated letters are allowed)? O P(11, 4) x 37 11! 4!-4!-3! O C(11, 4) x 27 O C(11, 4) x 37 O x 27 O P(11, 4) x 27

What is the auxiliary space complexity and average time complexity of randomized rapid sort?

In python: Modifydef clipped_hist(df, clip_threshold = 1) to plot a Gaussian distribution on top of a normalized histogram.

We create a Hash-table of integers where the hash function returns the first digit of the integer(For example, for 33 it returns 3). If we use a binary search tree as the value storage of our hash-table, what is the time-complexity to look up an integer in it?* O(Log(N)) O(N*Log(N)) O(N) O(N^2)