Signup as a Tutor

As a tutor you can connect with more than a million students and grow your network.



Please enter valid question or comment

Please select a category

Please enter your name.

Please enter valid Phone Number

Please enter the Pin Code.

By submitting, you agree to our Terms of use and Privacy Policy

Connect With Ajay

You have reached a limit!

We only allow 20 Tutor contacts under a category. Please send us an email at for contacting more Tutors.

You Already have an UrbanPro Account

Please Login to continue

Please Enter valid Email or Phone Number

Please Enter your Password

Please Enter valid Password or OTP

Forgot Password? Resend OTP OTP Sent

Sorry, we were not able to find a user with that username and password.

We have sent you an OTP to your register email address and registered number. Please enter OTP as Password to continue

Further Information Received

Thank you for providing more information about your requirement. You will hear back soon from the trainer




Online Instructor led Course

Platform: WizIQ


No Reviews Yet
1 Interested

About the Course

Analysis and Design of Algorithm course is for B.E./ B. Tech students studying Analysis and Design of Algorithm in current semester

Topics Covered

Unit I
Concepts of algorithm, asymptotic complexity, examples of analysis use of recurrence relation in analysis of algorithms, removal of recursion, heap and heap sort, disjoint set structure.

Unit II
Divide and conquer technique, analysis and design of algorithms base on this technique for binary search, merge sort, quick sort, selection problem matrix multiplication.

Unit III
Study of greedy strategy, solutions based on greedy strategy for knap sack problem, minimum spanning trees, scheduling problem, shortest paths optimal merge patterns. Concept of dynamic programming and problems based on this approach such as O/I knapsack problem, multi-stage graphs, shortest paths, travelling sales person problem, reliability design problem.

Unit IV
Depth-first search, breadth search, bi-connected components. Backtracking concept and its example like 8-queen's problem, Hamiltonian cycle problem, introduction to branch and its examples like 8-puzzle problem travelling sales-person problem.

Unit V
Binary search trees, height balanced trees, AVL trees, 2-3 trees, B-trees hashing. Introduction to lower-bound theory introduction to NP-Complete and NP Hard problems, examples of NP complete problem like Hamiltonian path and circuits, Eulerian paths and circuits etc.

Who should attend

B.E./ B. Tech students studying Analysis and Design of Algorithm in current semester



What you need to bring

Notebook and Pen

Key Takeaways

Analysis and Design of Algorithm Subject
There are no Reviews yet. Be the First to Review
Questions and Comments

Thousands of experts Tutors, Trainers & other Professionals are available to answer your questions

Comment ?

Questions Guidelines

  • Start your question with simple statements like "what", "when", "where", or "how".
  • Ensure your question or answer is not offensive or insensitive - it may be voted down or banned.
  • Please provide as much detail as possible as this will allow our members to better understand and respond to your question.
  • Take some time to categorize your question. This will greatly help other users find the question.

You can add upto 6 Images


There are no Reviews yet. Be the First to Review

Date and Time

Not decided yet.

cash back100% Money Back Guarentee

About the Trainer

Ajay Pathak

B Tech From NIT Bhopal

Have more than 5.6 years of experience in IT industry. Worked with CSC,Microsoft and Talentica.
Seats Left-

Students Interested 1

Course Id: 5990