• Like
  • Save
Algorithm class
Upcoming SlideShare
Loading in...5
×
 

Algorithm class

on

  • 506 views

Algorithm class course details

Algorithm class course details

Statistics

Views

Total Views
506
Views on SlideShare
506
Embed Views
0

Actions

Likes
0
Downloads
19
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Algorithm class Algorithm class Presentation Transcript

    • ALGORITHM CLASSS DATA STRUCTURES AND ALGORITHMS ALGORITHM CLASSS
    • COURSE DETAILS Each of the following topics and related frequently asked questions would be discussed.      C programming Arrays Strings structures and unions pointers     Algorithm analysis Stacks ADT Recursion Queqes ADT ALGORITHM CLASSS
    • COURSE DETAILS Linked list Tournament tree to find max element  Circular linked list, double linked list Trees ADT Preorder, inorder and post order traversals Tree delete operation ALGORITHM CLASSS
    • COURSE DETAILS Sorting Bubble sort Insertion sort Quick sort Merge sort Heap sort Priority queue ALGORITHM CLASSS
    • COURSE DETAILS Searching Binary search Hash table 2-4 trees AVL trees Tries ALGORITHM CLASSS
    • COURSE DETAILS example with stack Stack is explained with the following functions  Int IsEmpty(Stack S); Stack createStack(void); Void DisposeStack(stack S); Void MakeEmpty(Stack S); Void push(elementType x, stack S); void pop(stack S);  isEmpty(); elementType Stacktop(stack s); ALGORITHM CLASSS
    • COURSE DETAILS with stack related questions like … For each topic(here stack) the related questions would be covered  Find whether given string is polyndrom or not  Evaluating postfix expression  Convert an infix expression to postfix expression  Check whether the expression is balanced or not ( finding matching (,) and [] and {}  Reverse stack  Sort stack  Implement queue with stack functionality ALGORITHM CLASSS
    • CONTACT FOR MORE DETAILS Please send mail to algorithm.class@gmail.com visit https://sites.google.com/site/algorithmclas ALGORITHM CLASSS