Address:
304 Aarohi Complex,
Near RasRanjan Sweet Mart,
Vijay Char Rasta,
Navrangpura,Ahmedabad
Cell: 09375960898
Home
New Batches Info
What Students Say???
Computer Training
Special Free Seminars
Upcoming Free Seminars
Old Presentations
Free Services
Exam Paper Solutions
Resume Guidance
Useful Links
About/Contact/Partner Us
About Us
Contact Us
Partner with Us
Final Project/Corporate Training
Final Year Project
B.C.A Project Training
M.C.A Project Training
ASP.NET Project Training
PHP Project Training
Corporate Training
C/C++/Cobol/DFS/Assembly
C Programming
Knowledge of C Programming
C++ Programming
Cobol
Data Structure
Assembly Language
VB
VB6
VB.NET/ASP.NET/SQL Server 2000
VB.NET/ASP.NET/SQL Server 2000
Oracle
Sql
Pl/Sql
Java/JSP/Servlets/J2EE
Java Programming
Adv. Java Programming
JSP/Java Servelt
Adv. J2EE Programming
Linux/Apache/MySQL/PHP/HTML/JavaScript
Linux Basic
Linux Advanced
Apache Server
HTML
JavaScript
PHP/MySQL
Tally
Tally
10th/12th Standard
10th Standard
12th Standard
SEO/Hacking/Technical Writining/Perl
SEO
Sunday Hacking Class
Technical Writing
Perl
Bio-informatics
Dhavni-Patel-Students-Video
Basic Bio-info. Perl
Adv.Basic Bio-info with Perl
Looking for Data Structure Training in Ahmedabad?
Course: Data Structure
Introduction
Introduction to Data Structure
Classification
Primitive
Non – Primitive
Linear
Non - Linear
Arrays
Array Concept
One Dimension
Two Dimension
Memory Representation of One & Two Dimensional Array
Row Major
Column Major
Operations on Arrays
Insertion
Deletion
Traversal
Sparse Matrix
Memory Representation of Sparse Matrix (Vector Notation)
Representation of Polynomial
Searching & Sorting
Sequential Search
Binary Search
Comparison of Sequential & Binary Search in terms of Efficiency
Bubble Sort
Selection Sort
Insertion Sort
Quick Sort
Merge Sort
Comparison among all sort in terms of their efficiency
Stacks
Properties of Stacks
Stack representation using Arrays
Stack Operations
Push
Pop
Peep
Change
Application of Stack
Recursion
Expression : Infix ,Postfix ,Prefix with their conversions
Queues
Properties of Queue
Circular Queue
Priority Queue
Double ended Queue
Queue representation using Array
Queue Operations
Insert
Delete
Application of Queue
Linked Lists
Singly Linked Lists
Doubly Linked Lists
Circular Linked Lists
Header Linked Lists
Operations of Linked Lists
Insertion
Deletion
Traversal
Split
Join
Application of Linked Lists
Representation of Polynomial
Implementation of Stack & Queue
Trees
Binary Trees & its properties
Binary Search Tree
Operations on Trees
Creation
Traversal
Preorder
Postorder
Inorder
Search
Deletion
Representation of Tree using Arrays & Linked List
Applications of Binary Trees
Threaded Binary Tree
Heap Tree
B-Trees
AVL Tree
Expression Tree
Introduction to Forest & conversion of Forest into Binary Tree
Graphs
Weighted Graphs
Representation of Graphs
Adjacency Matrix
Adjacency List
DFS & BFS Algorithms
Minimum Spanning Tress
Prim’s Algorithm
Greedy Method
Application:Traveling Salesman Problem
PERT & CPM