VAMSI - Algorithms tutor - Visakhapatnam
VAMSI - Algorithms tutor - Visakhapatnam

VAMSI's email address and phone number have been validated.

VAMSI

  • Rate €9
  • Response 1h
VAMSI - Algorithms tutor - Visakhapatnam

€9/h

More Algorithms tutors

Unfortunately, this tutor is unavailable

  • Algorithms

Design and analysis of algorithms (daa) - iii b.tech sem 1 / 2

  • Algorithms

Lesson location

About VAMSI

I AM GRADUATE IN INFORMATION TECHNOLOGY FROM ACHARYA NAGARJUNA UNIVERSITY , GUNTUR AND POST GRADUATE IN COMPUTER SCIENCE AND TECHNOLOGY FROM ANDHRA UNIVERSITY , VISAKHAPATNAM.

I AM CURRENTLY WORKING AS A ASSISTANT PROFESSOR OF CSE DEPARTMENT IN " VIGNANS INSTITUTE OF INFORMATION TECHNOLOGY (AUTONOMOUS), VISAKHAPATNAM.

See more

About the lesson

  • Primary School
  • Secondary School
  • Post-Secondary Education
  • +10
  • levels :

    Primary School

    Secondary School

    Post-Secondary Education

    1st year of Sixth Form

    2nd year of Sixth Form

    Adult education

    Bachelor

    Masters

    Doctorate

    Other

    Qualified Lawyer Transfer Scheme

    MBA

    Kindergarten

  • English

All languages in which the lesson is available :

English

MY TEACHING METHODOLOGY IS BASED ON AS FOLLOWS:

Introduction: What is an Algorithm, Algorithm Specification, Pseudocode Conventions
Recursive Algorithm, Performance Analysis, Space Complexity, Time Complexity, Amortized
Complexity, Amortized Complexity, Asymptotic Notation, Practical Complexities, Performance
Measurement.

Dived and Conquer: General Method, Defective Chessboard, Binary Search, Finding the
Maximum and Minimum, Merge Sort, Quick Sort, Performance Measurement, Randomized
Sorting Algorithms.

The Greedy Method: The General Method, Knapsack Problem, Job Sequencing with Deadlines,
Minimum-cost Spanning Trees, Prim’s Algorithm, Kruskal’s Algorithms, An Optimal
Randomized Algorithm, Optimal Merge Patterns, Single Source Shortest Paths.


Dynamic Programming: All - Pairs Shortest Paths, Single – Source Shortest paths General
Weights, String Edition, 0/1 Knapsack, Reliability Design,

Backtracking: The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring ,
Hamiltonian Cycles.

See more

Rates

Rate

  • €9

Pack rates

  • 5 h: €42
  • 10 h: €85

online

  • €9/h

Other tutors in Algorithms