Search results
A passionate and enthusiast programmer. - 👨🏭 I’m currently pursuing B.Tech CSE From Lovely Professional University. - 🏫 I’m currently learning Data Structures And MERN Stack Development. - 🙌 I’m looking to collaborate on Web Projects. - 🤔 I’m looking for help with Model Training.
- GitHub - Bhanupriya-art/CSE408-Coursera-Answers: This ...
GitHub - Bhanupriya-art/CSE408-Coursera-Answers: This...
- GitHub - Bhanupriya-art/INT426-Coursera-Answers: This ...
Answer:- A generative AI model could be trained on a dataset...
- bhanupriya-code (Bhanupriya) · GitHub
bhanupriya-code has 22 repositories available. Follow their...
- bhanupriya01 (Bhanupriya) · GitHub
🎯. Bhanupriya bhanupriya01. Block or Report. Popular...
- GitHub - Bhanupriya-art/CSE408-Coursera-Answers: This ...
- Week 1:- Analysis of Algorithm Graded Quiz:-
- Week 2:- Recurrence Pop Quiz On Telescoping:-
- Week 2:- Recurrence Pop Quiz On Master Theorem:-
- Week 2:- Recurrence Graded Quiz:-
- Week 3:- Generating Functions Quiz:-
- Week 4:- Asymptotics
- Extra Question
- Week 5:- Analytic Combinatorics
- Week 6:- Trees Quiz
- Week 7:- Permutations
Q.1 What is the order of growth of the solution to the Quicksort-like recurrence FN = 2N + 1 + 1/N + ∑ 1≤K≤N (Fk - 1 + FN - K) with F0 = 0? 1. 0 2. 1 3. 1/N 4. N 5. N log N 6. $ N^2$ 7. $ N^3$ Answer:- 5. N log NQ.2 Which of the following is a drawback to analyzing algorithms by proving O- upper bounds on the worst case? 1. Generally cannot be used to predict performance. 2. Input model may be unrealistic. 3. Generally cannot be used to compare algorithms. 4. Likely to be too much detail in the analysis. Answer:- Option 1 & 3Q.3 What is the order of growth of the solution to the Quicksort-like recurrence FN = N2 + 1 + 1/N + ∑ 1≤K≤N (Fk - 1 + FN - K) with F0 = 0? 1. 0 2. 1 3. 1/N 4. N 5. N log N 6. $N^2$ 7. $N^3$ Answer:- 6. $N^2$Q.1 Solve the recurrence an = nan - 1 + n! for n > 0 with a0 = 1. Give a simple expression for an
1. (n + 1)!
2. 2n!
3. n!
4. (2n)!
5. n! + (n - 1)!
Q.1 Suppose that an = 2a[n/3] + n for n > 2 with a0 = a1 = a2 = 1. What is the order of growth of an ?
1. O(n3)
2. O(n2)
3. O(n log n)
4. O(n)
Answer:- 4. O(n)
Q.1 Which of the following is true of the number of comparisons used by Mergesort? 1. Is less than N lg N + N/4 for all N 2. Order of growth is N lg N 3. Exactly N lg N when N is a power of 2 4. Has periodic behavior Answer:- All options are correctQ.2 Suppose that nan = (n - 3)an - 1 + n for n > 2 with a0 = a1 = a2 = 0. What is the value of a999? Answer:- 250Q.1 Which of these sequences is represented by the OGF ln 1/1 - z2 ? Answer:- 0 , 0 , 1/2 , 0 , 1/4 , 0 , 1/6Q.2 Which of these sequences is represented by the OGF z2 ⁄ (1 - z3) ? Answer:- 0 , 0 , 1 , 3 , 6 , 10 , ...Q,3 Which of these sequences is represented by the OGF 3 ⁄ ( 1 - z ) ? Answer:- 3, 3, 3, 3, 3, ...Q.4 Which of these sequences is represented by the OGF 1 ⁄ ( 1 - 3z) ? Answer:- 1, 3, 9, 27, 81, 243, ...Q.5 Suppose that an = 9an - 1 - 20an - 2 for n > 1 with a0 = 0 and a1 = 1. What is the value of limn -> ∞ an / an - 1 ? Answer:- 5Q.6 What is the value of ∑0≤k≤n(2k⁄k)( 2n-2k ⁄ n-k ) ? Answer:- 4nQ.1 Give an asymptotic approximation of eH2N to within O ( 1 ⁄ N2 ) Answer:- 2 - 1 ⁄ 2N + O ( 1 ⁄ N2 )Q.2 Which of the following has approximate value 1.62889? Answer:- 1.0510Q.1 Match each function with an asymptotic expansion.Q.2 Match each expression with an approximation to its value.Q.1 Which of these constructions defines the set of all binary strings? Answer:- B = E + (Z0 - Z1) X BQ.2 What is the approximate value of [zn] 1 ⁄ (1 - 2z)(1 - 3z) ? Answer:- 3n+1Q.1 Which of the following constructions defines the Motzkin (unary-binary) trees? Answer:- M = Z + Z X M + Z X M X MQ.2 Of the following, which are the least numerous, for a given (large) number of nodes? Answer:- unordered treesQ.3 Of the following, which are the most numerous, for a given (large) number of nodes? Answer:- 3-ary treesQ.1 Of the following, which is the best approximation to the probability that a permutation of size N has exactly 1 cycle? Answer:- 1 ⁄ NQ.2 Which event is leastlikely, in a random permutation of size 1000? Answer:- It has no cycles of length less than 5.Q.3 Of the following, which is the best approximation to the probability that a permutation of size N has exactly 3 cycle? Answer:- ln N / N2Q.4 Of the following, which is the best approximation to the probability that a permutation of size N has exactly 2 cycle? Answer:- ln N / NQ.5 Which event is mostlikely, in a random permutation of size 1000? Answer:- It has no cycles of length 1, 2, 3, or 7.Answer:- A generative AI model could be trained on a dataset of images of cats and then used to generate new images of cats. A discriminative AI model could be trained on a dataset of images of cats and dogs and then used to classify new images as either cats or dogs.
bhanupriya-code has 22 repositories available. Follow their code on GitHub.
🎯. Bhanupriya bhanupriya01. Block or Report. Popular repositories. bhanupriya01 Public. Config files for my GitHub profile. find-naughty-candidate Public. Write a program that can tell the principal both the least and the most naughty candidate in the list. Python. 0 contributions in the last year. Learn how we count contributions. Less More.
May 17, 2022 · ⚡ETE FULL QUESTION PAPER📃(MCQ Type)⚡ || CSE 408 || 4th semester ||LPU|| ETE ques paper series-- For more info scroll down👇=====...
- 7 min
- 567
- Assignment mohobat se
May 19, 2024 · In this video, I will let you know Most important and Frequently asked MCQs of Unit 4 of CSE408, Design and Analysis of algorithm which is Dynamic Programmin...
- 14 min
- 5.2K
- Cool Information
