MAKES CODE EASY

Q 1.   What is the height of the output image after an input image of size 128 x 128 is passed through a convolution filter of size 32 x 32 and stride 8 followed by a convolution filter of size 3 x 3 and stride 1? All dimensions are specified as height x width ? Answer :    11 Q 2.   Consider a two-layer neural network with identical weights W and bias b in each layer and activation function Sigmoid. If the input to the network is x, what is the sum of elements in the output vector? Round your answer to two decimal places      Answer  :      1.50 Q 3. If g(z) is the sigmoid function, which of the following is the correct expression for its derivative with respect to z   g(z)   1-g(z)   g(z) * (1 - g(z))   g(z) / (1 - g(z)) Answer:     g(z) * (1 - g(z))   Q 4.   Which of the following logical expression(s) involving two variables can be implemented using a single perceptron with the sign ...

Question 1 What is time complexity of fun()? int fun( int n) {    int count = 0;    for ( int i = n; i > 0; i /= 2)       for ( int j = 0; j < i; j++)          count += 1;    return count; } A O(n^2) B O(nLogn) C O(n) D O(nLognLogn) Discuss it Question 2 What is the time complexity of fun()? int fun( int n) {    int count = 0;    for ( int i = 0; i < n; i++)       for ( int j = i; j > 0; j--)          count = count + 1;    return count; } A Theta (n) B Theta (n^2) C Theta (n*Logn) D Theta (nLognLogn) Discuss it Question 3 The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is. (GATE CS 2012) A T(n) = 2T(n – 2) + 2 B T(n) = 2T(n – 1) + n C T(n) = 2T(n/2) + 1 D T(n) = 2T(n – 1) + 1 Discuss it Question 4 Let w(n) and A...