- Questions related to sort , algorithms , Pseudocode
1Algorithm | characteristics of the algorithms
Pseudocode | Pseudocode with example?
3. Asymptotic notations used in algorithms
Big Oh notation..
Omega notation.
Theta Notation .
short notes:
Space Complexity
Time Complexity
Best Case Complexity
Max Heap.Explain how time complexity of an algorithm is computed?
Frequency count | algorithm.
What is Disjoint Set.
Operations | performed | disjoint set?
what is Weighting Rule. state it with examples
.what is the Collapsing Rule.
Heap-sort algorithm | complexity.
Counting sort algorithm |
calculate its complexity.
.Sort | elements |using Heap-sort..
.Sort | elements | using Counting Sort.
Sort the given given elements using radix Sort.
Monday, 20 August 2012
Previous Post
Logic for Struct code | examples struct queue
Devs
FYJC XI standard online admisson Process and declaraton of Merit list . Cut off List For prevous year also . 10 Th Results onlne declaraton Maharashtra Region .
Related Posts
dynamic programming | Knapsack problem | multistage graph principle of optimality interview question papersdynamic programming | Knapsack problem | multistage graph&… Read More
NP Hard AND NP Complete problems QuestionsNP Hard AND NP Complete problems1.How to write deterministic and… Read More
Branch bound , algorithm interview questionsBranch bound , algorithm interview question paper1. what Is Bran… Read More
Backtracking ,N-queens problem, Hamiltonian cycles, m-coloring of graph, interview1.what is backtracking ?explain the implicit and explicit constraints.… Read More
Design And Analysis of Algorithms | chapters | TopicsDesign And Analysis of Algorithms | chapters | TopicsIntroductio… Read More
Greedy Method | Krushkal’s | Dijkstra’s algorithm | knapsack instanceinterview questions for Greedy Method | Krushkal’s | Dijkstra’s … Read More
0 comments: