Coders

  Kohli was out nicking off once again Mitchell Starc and Josh Hazlewood left India in disarray on the third morning of the Brisbane Test after Australia pushed their total to 445. In a stop-start session affected by frequent drizzles, the visitors were reduced to 22 for 3 with Yashasvi Jaiswal, Shubman Gill, and Virat Kohli sent back to the sheds for single-digit scores. After a third spell of rain delayed the start of India's first innings, Starc accounted for Jaiswal again, this time with his second delivery. The mode of the dismissal though might have yet to be planned for as India's young southpaw flicked a full ball straight to the fielder placed in front of the square. Mitchell Marsh then pulled off a superb catch at Gully as Gill looked to drive Starc without quite getting his balance right while moving forward. Kohli suffered near misses in his short stay as he was beaten on the drive and then hurried by a short ball. His 16-ball stay ended in a rather familiar manne...

  LIVE: T20 World Cup-winning Indian team to land in New Delhi on Thursday Team India Arrival Live Updates: Team India has reached IT Maurya hotel after landing at the Delhi airport on Thursday morning. Plenty of fans have gathered outside the airport to get a glimpse of Rohit Sharma's champions. The hotel staff has arranged a huge welcome for the World Cup champions, which include a special cake and some welcome drinks. The Indian squad will next meet PM Narendra Modi at 11 am at his residence and later go back to the hotel. The squad is expected to leave for Mumbai at 4 pm on Thursday evening. The team will later take part in an open bus road show followed by a felicitation ceremony at the Wankhede Stadium in Mumbai.

Ada Lovelace, the first programmer and a visionary mathematician, was chiefly known for her work on Charles Babbage's proposed mechanical general-purpose computer, the Analytical Engine. She was fond of sequences. During her studies she came across an infinite sequence that was generated using the following algorithm, starting with an empty sequence. Starting from step number 1, in step number  i,  the integer  i  is appended to the sequence exactly  k  times where  k  is equal to the number of set bits in  i. Given an array  query  of  n  integers,   for each query, find the value at the given index of the array assuming indexing starts at 0 .  Report an array of  n  integers where the  x th   integer represents the answer to the  x th  query. Example Given, n = 2 and query = [4, 10], the sequence is generated as follows. Step Number Bina...

 You are given a tree with n nodes. Each node has a value assigned with it. The cost of a path is defined as the summation of all the values assigned to nodes that belong to the path. The root of the tree is node number 1. Cost of path example The cost of the path 6 -> 5 -> 3 -> 1 in the above tree is 42 + 31 + 20 + 10 = 103. A Vertical Path in a tree is the path that is going up towards the root of the tree. It is not necessary for the path to end at the root. Given a tree with n nodes and an integer k . Find the number of vertical paths such that the (cost of the path) % k = 0 where % represents the modulo operation. Note: The modulo operation returns the remainder of a division after one number is divided by another. For example - 5 % 2 = 1. Example k = 2 tree = There are a total of 8 vertical paths: 1 2 4 2->1 4->1 3 3->4 3->4->1 But only (2 -> 1), (4 -> 1),...

ANSWERS  1. a 2. d 3. a 4. d 5. a 6. b 7. d 8. a 9. b 10. c Week 7 : Assignment 7 Due date: 2023-03-15, 23:59 IST. Assignment not submitted 1 point Which of the following statement is NOT true about clustering?   a. It is a supervised learning technique   b. It is an unsupervised learning technique   c. It is also known as exploratory data analysis   d. It groups data into homogeneous groups 1 point Which of the following clustering technique start with the points as individual clusters and, at each step, merge the closest pair of clusters   a. K-Means clustering   b. DBSCAN   c. Divisive clustering   d. Agglomerative clustering 1 point DBSCAN is a___________ algorithm   a. Partitional clustering   b. Hierarchical clustering   c. Fuzzy clustering   d. Complete clustering 1 point The Euclidean distance matrix between four 2-dimensional points, p1, p2, p3, and p4, is shown below. A possible set of co-ordinate values of these...

  Week 06: Assignment 06 ANSWERS 1. c 2. a 3. d 4. a 5. d 6. b 7. a 8. a 9. a 10. b Due date: 2023-03-08, 23:59 IST. Assignment not submitted 1 point Sufficient Number of output nodes required in an ANN used for two-class classification problem is:   a. Random number   b. Same as number of input nodes   c. 1   d. 2 1 point How are the weights and biases initialized in an ANN in general?   a. Can be initialized randomly   b. Always initialized to zero   c. Always initialized to infinity   d. Always initialized as 1 1 point In which of the below neural network, the links may connect nodes within the same layer or nodes from one layer to the previous layers?   a. Perceptron   b. Feed-forward neural network   c. Recurrent neural network   d. Both B, C 1 point Neural Networks are complex ______________ with many parameters.   a. Linear Functions   b. Nonlinear Functions   c. Discrete Functions   d. Exponenti...