search
Menu Login home
X
Menu
  • Home
  • Privacy Policy
  • Legal Disclaimer
  • Terms & Conditions
  • Return Policy
  • About Us
  • Need any help?? write to us at

    support@engineershub.co

    Follow Us

    X
    Continue with LinkedIn
    Or Use Your Email Address/Mobile
    Forgot Password?
    Not a member? Sign Up
    LOGIN WITH EMAIL/MOBILE
    Forgot Password?
    Go Back
    FORGOT PASSWORD
    Go Back
    RESET PASSWORD
    Go Back
    Continue with LinkedIn
    OR
    Fill Up a Simple Form
    Already a Member? Login
    SIGN UP
    Go Back
    Computer Algorithms by Ellis Horowitz, Sartaj Sahni and S. Rajasekharan. - Subject Study Materials - EngineersHub
    Go Back
    File
    Kurma Swetha
    5 months ago
    Share on Whatsapp
    WHAT IS AN ALGORITHM?,ALGORITHM SPECIFICATION,PERFORMANCE ANALYSIS,RANDOMIZED ALGORITHMS,REFERENCES AND READINGS,ELEMENTARY DATA STRUCTURES, STACKS AND QUEUES, TREES, DICTIONARIES, PRIORITY QUEUES, SETS AND DISJOINT SET UNION,DIVIDE-AND-CONQUER,GENERAL METHOD,BINARY SEARCH,FINDING THE MAXIMUM AND MINIMUM,MERGE SORT,QUICKSORT,SELECTION,STRASSEN'S MATRIX MULTIPLICATION,CONVEX HULL,THE GREEDY METHOD,THE GENERAL METHOD,KNAPSACK PROBLEM,TREE VERTEX SPLITTING,JOB SEQUENCING WITH DEADLINES,MINIMUM-COST SPANNING TREES,OPTIMAL STORAGE ON TAPES,OPTIMAL MERGE PATEERNS,SINGLE-SOURCE SHORTEST PATHS,DYNAMIC PROGRAMMING,THE GENERAL METHOD,MULTISTAGE GRAPHS,ALL PAIRS SHORTEST PATTIS,SINGLE-SOURCE SHORTEST PATHS,GENERAL WEIGHTS,OPTIMAL BINARY SEARCH TREES,STRING EDITING,0/ I-KNAPSACK,RELIABILITY DESIGN,THE TRAVELING SALESPERSON PROBLEM,FLOW SHOP SCHEDULING,BASIC TRAVERSAL AND SEARCH TECHNIQUES,TECHNIQUES FOR BINARY TREES,TECHNIQUES FOR GRAPHS,CONNECTED COMPONENTS AND SPANNING TREES,BICONNECTED COMPONENTS AND DFS,BACKTRACKING,THE GENERAL METHOD,THE 8-QUEENS PROBLEM,SUM OF SUBSETS,GRAPH COLORING,HAMILTONIAN CYCLES,KNAPSACK PROBLEM,BRANCH-AND-BOUND,THE METHOD,0/1 KNAPSACK PROBLEM,TRAVELING SALESPERSON (s),EFFICIENCY CONSIDERATIONS,EVALUATION AND INTERPOLATION,THE FAST FOURIER TRANSFORM,MODULAR ARITHMETIC,EVEN FASTER EVALUATION AND INTERPOLATION,LOWER BOUND THEORY,COMPARISON TREES,ORACLES AND ADVERSARY ARGUMENTS,LOWER BOUNDS THROUGH REDUCTIONS,NP-HARD AND NP-COMPLETE PROBLEMS,COOK'S THEOREM,NP-HARD GRAPH PROBLEMS,NP-HARD SCHEDULING PROBLEMS,NP-HARD CODE GENERATION PROBLEMS,SOME SIMPLIFIED NP-HARD PROBLEMS,APPROXIMATION ALGORITHMS,ABSOLUTE APPROXIMATIONS, GAPPROXIMATIONS,COMPUTING THE CONVEX HULL,LOWER BOUNDS,MESH ALGORITHMS,COMPUTATIONAL MODEL,PACKET ROUTING,FUNDAMENTAL LGORITHMS,SELECTION,MERGING,SORTING,GRAPH PROBLEMS, COMPUTING THE CONVEX HULL, HYPERCUBE ALGORITHMS, COMPUTATIONAL MODEL,PPR ROUTING,FUNDAMENTAL ALGORITHMS,SELECTION,MERGING,SORTING,GRAPH PROBLEMS.

    Computer Algorithms by Ellis Horowitz, Sartaj Sahni and S. Rajasekharan.

    Subject Study Materials

    pdf

    54 Downloads

    EngineersHub Logo
    x
    Loading...