(186) Algorithms: What are the very basic algorithms that every Computer Science student must be aware of. Quantitative Reasoning 20 Assignments. There will be weekly assignments listed here. They will usually be assigned on Thursday and due the following Friday. Toward the end of the course, the assignments will be a little more challenging and 2 weeks will be allowed to complete them. Assignment 1, to be completed in section week of Feb. 1, but give it a try before then. Assignment 2, due in your TF's assignment 2 drop box by 5PM, Fri., Feb. 12. A statement of the homework grading policy Assignment 3, due in your TF's assignment 3 drop box by 5PM, Fri., Feb. 19.
Assignment 4, due in your TF's assignment 4 drop box by 5PM, Fri., Feb. 26. Assignment 5, due in your TF's assignment 5 drop box by 5PM, Fri., Mar. 5. Assignment 6, due in your TF's assignment 6 drop box by 5PM, Fri., Apr 2. verbs.py A module to save you from typing in dictionaries of verb roots and inflectional endings. Assignment 7, due in your TF's assignment 7 drop box by 5PM, Fri., Apr. 9 Assignment 8, due in your TF's assignment 8 drop box by 5PM, Fri., April 16.
Data Structures and Algorithm. MyCareerStack | Programming Questions. Technical Interview Question of the Day Archive. Algo Muse. 16-1 In the box There are n identical boxes in which 2n balls are equally distributed. The balls are labelled from 1 to 2n. We don't know which ball is in which box, but do know that each box contains two balls. The objective is to learn the arrangement of balls. For any set of balls S ⊆ {1,...,2n} we can ask a query of the form `How many boxes contain the balls in S? '. For example, consider the distribution of balls shown below.
The query `How many boxes contain balls 1,2 and 5? ' Prove that we can learn the distribution of balls by asking O(n log n) queries. Note that we cannot tell which ball is in which box. Solution Solution There are n pairs of balls. Lemma. Proof. How many boxes contain the balls in set A? If answers to both the questions are same, then x is paired with one of the balls in set A; else x is paired with one of the balls in set B. 16-2 Evasive Tree We prove the lower bound for the special case when the tree is a path, using an adversarial argument.
Analysis. Programming.
SitePoint – Learn HTML, CSS, JavaScript, PHP, Ruby & Responsive Design. Index of /disc-source. Programming Interview Questions | CareerCup. GeeksforGeeks | A computer science portal for geeks. Learn How to Code this Weekend. Web apps.