Course Content
How to watch video course and download study material from enrolled courses?
0/2
How to watch video courses?
01:40
How to download Study Materials (PDF) from the enrolled courses?
01:10
Module-1 of Model Paper-1 (Explained with solutions)
0/2
1a] Define algorithm. Explain asymptotic notations Big Oh, Big Omega and Big Theta notations 1b] Explain the general plan for analyzing the efficiency of a recursive algorithm. Suggest a recursive algorithm to find factorial of number. Derive its efficiency 1c] If t1(n) ∈ O(g1(n)) and t2(n) ∈ O(g2(n)), then show that t1(n) + t2(n) ∈ O(max{g1(n), g2(n)}).
08:47
2a] With neat diagram explain different steps in designing and analyzing an algorithm 2b] Explain the general plan for analyzing the efficiency of a non-recursive algorithm. Suggest a non-recursive algorithm to find maximum element in the list of n numbers. Derive its efficiency 2c] With the algorithm derive the worst case efficiency for Bubble sort
05:55
Module-2 of Model Paper-1 (Explained with solutions)
0/2
3a] Explain the concept of divide and conquer. Design an algorithm for merge sort and derive its time complexity 3b] Design an insertion sort algorithm and obtain its time complexity. Apply insertion sort on these elements. 25,75,40,10,20,
07:20
4a] Explain Strassen’s matrix multiplication and derive its time complexity 4b] Design an algorithm for quick sort algorithm. Apply quick sort on these elements. 25,75,40,10,20,05,15
11:35
Module-3 of Model Paper-1 (Explained with solutions)
0/2
5a ] Define AVL Trees. Explain its four rotation types 5b] Construct bottom up heap for the list 2,9,7,6,5,8. Obtain its time complexity
07:42
6a] Define heap. Explain the properties of heap along with its representation. 6b] Design Horspools algorithm for string matching. Apply Horspools algorithm to find the pattern BARBER in the text: JIM_SAW_ME_IN_A_BARBERSHOP
10:35
Module-4 of Model Paper-1 (Explained with solutions)
0/2
7a] Construct minimum cost spanning tree using Kruskals algorithm for the following graph. 7b] What are Huffman Trees? Construct the Huffman tree for the following data.
07:29
8a] Apply Dijkstra’s algorithm to find single source shortest path for the given graph by considering S as the source vertex. 8b] Define transitive closure of a graph. Apply Warshalls algorithm to compute transitive closure of a directed graph
11:15
Module-5 of Model Paper-1 (Explained with solutions)
0/2
9a] Explain the following with examples i) P problem ii) NP Problem iii) NP- Complete problem iv) NP – Hard Problems 9b] What is backtracking? Apply backtracking to solve the below instance of sum of subset problem S={5,10,12,13,15,18} d=30
05:40
10a] Illustrate N queen’s problem using backtracking to solve 4-Queens problem 10b] Using Branch and Bound technique solve the below instance of knapsack problem.
10:13
Analysis and Designs of Algorithms (ADA) || BCS401 || BCO402 || BAD401 || Model Question Paper-1 with solutions (EXPLAINED) || CSE stream || 2022 Scheme || Video Course and Study Material
Previous
Next
Join the conversation
Shubham Pawale 4 months ago
Nice
Reply
0% Complete

Want to earn money while learning? check out our refer and earn program

click here
Any doubts?
Call us immediately

Follow us on social media for regular updates

Instagram Linkedin Youtube

Quick Links

"At LearnyHive, we help students with the essential last-minute preparation they need to clear their semester exams and provide tutors with the platform they deserve."
"At LearnyHive, we help students with the essential last-minute preparation they need to clear their semester exams and provide tutors with the platform they deserve."
Amar Karthik Co-Founder & CTO

Tutorials

Instagram Linkedin Youtube
Copyright © LearnyHive.com 2024. All rights reserved.
Designed, Developed and Maintained by UnikBrushes
Terms, Privacy Policy, Cookies Policy, Refund Policy