Monday 20 August 2012

Radix Sort | Counting Sort. | Theta Notation | Pseudocode Questions

  • 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.
Share This
Previous Post
Next Post

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 .

0 comments: