ºÝºÝߣ

ºÝºÝߣShare a Scribd company logo
Mastering
Data Structures
Course Highlights
ï‚· Aimed at C programmers looking for a firm grip on data structures
ï‚· Course delivered on Linux platform, using GNU C
ï‚· Covers core DS concepts like complexity, linked lists, trees, sorting, searching etc.
ï‚· Conducted over weekends
Course Duration
2 full days (10am to 5pm)
Course Prerequisites
Good C programming skills
301, Prashanthiram Towers, Saradhi Studio Lane, Ameerpet, Hyderabad
Ph:040-66100265 Email: info@techveda.org www.techveda.org
Course Contents
1) Introduction to the Complexity
ï‚· Space Complexity
ï‚· Time complexity
ï‚· Complexity Notation
2) Arrays and Pointers
3) Stacks
4) Queues
5) Linked Lists
ï‚· Single Linked Lists
ï‚· Doubly Linked Lists
ï‚· Circular Linked Lists
6) Trees
ï‚· Introduction to trees
ï‚· Binary and Binary Search Trees
ï‚· Introduction to AVL Trees
7) Sorting Techniques
ï‚· Insertion Sort
ï‚· Selection Sort
ï‚· Bubble Sort
ï‚· Quick Sort
ï‚· Merge Sort
ï‚· Heap Sort
8) Searching Techniques
ï‚· Linear Searching
ï‚· Binary Search
ï‚· Hashing
301, Prashanthiram Towers, Saradhi Studio Lane, Ameerpet, Hyderabad
Ph:040-66100265 Email: info@techveda.org www.techveda.org

More Related Content

Mastering Data Structures | data structures training Hyderabad

  • 1. Mastering Data Structures Course Highlights ï‚· Aimed at C programmers looking for a firm grip on data structures ï‚· Course delivered on Linux platform, using GNU C ï‚· Covers core DS concepts like complexity, linked lists, trees, sorting, searching etc. ï‚· Conducted over weekends Course Duration 2 full days (10am to 5pm) Course Prerequisites Good C programming skills 301, Prashanthiram Towers, Saradhi Studio Lane, Ameerpet, Hyderabad Ph:040-66100265 Email: info@techveda.org www.techveda.org
  • 2. Course Contents 1) Introduction to the Complexity ï‚· Space Complexity ï‚· Time complexity ï‚· Complexity Notation 2) Arrays and Pointers 3) Stacks 4) Queues 5) Linked Lists ï‚· Single Linked Lists ï‚· Doubly Linked Lists ï‚· Circular Linked Lists 6) Trees ï‚· Introduction to trees ï‚· Binary and Binary Search Trees ï‚· Introduction to AVL Trees 7) Sorting Techniques ï‚· Insertion Sort ï‚· Selection Sort ï‚· Bubble Sort ï‚· Quick Sort ï‚· Merge Sort ï‚· Heap Sort 8) Searching Techniques ï‚· Linear Searching ï‚· Binary Search ï‚· Hashing 301, Prashanthiram Towers, Saradhi Studio Lane, Ameerpet, Hyderabad Ph:040-66100265 Email: info@techveda.org www.techveda.org