Coders

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 Binary Representation of Number Number of set bits in Number Sequence 1 1 1 [1] 2 10 1 [1, 2] 3 11 2 [1, 2, 3, 3] 4 100 1 [1, 2, 3, 3, 4] 5 101 2 [1,

 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), (3

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 points are:   a.  p1=(0, 0), p2=(0, 1), p3=(1, 0), p4=(1, 1)  

  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. Exponential Functions 1 point Artificial neural network used for:   a. Pattern Recognition  

  Intellect Intellect AI Hackathon 2023: Stages and Timelines Code Submission Round Candidates will have to submit the solution to a problem statement in the given timeline. This is an elimination round. Start Date 16 Mar 23, 12:00 PM IST End Date 19 Mar 23, 11:59 PM IST Interview Round Shortlisted candidates from the previous round will get the opportunity to interact with Intellect's interview panel. Intellect All that you need to know about Intellect AI Hackathon 2023 A competition that identifies and recruits the best AI talent while testing their precision and endurance. Take on the challenge by participating in the Hackathon brought to you by Intellect. The sharpest minds who meet the criteria will receive an offer from us!  We are on the lookout for data science enthusiasts who can solve complexities to join our tribe to take forward our legacy of cutting-edge, future-ready technology.  Join us to experience the depth of expertise and thrill of risks!  About Intellect Design