Courses Offered: SCJP SCWCD Design patterns EJB CORE JAVA AJAX Adv. Java XML STRUTS Web services SPRING HIBERNATE  

       

Data Structure Course Details
 

Subscribe and Access : 3000+ FREE Videos and 21+ Subjects Like CRT, SoftSkills, JAVA, Hadoop, Microsoft .NET, Testing Tools etc..

Batch Date: Feb 1st @ 2:30PM

Faculty: Mr. Kiran

Duration: 30 Days

Fee:  2500/- INR + Reg Fee 100/-INR (Including C, C++ & Data Structures Through C & C++)

Only 'C': 1000/-INR

Only 'C++': 1000/-INR

Only 'DS': 1000/-INR

Location : Maitrivanam - 202, Hyderabad.

Venue :
DURGA SOFTWARE SOLUTIONS at Maitrivanam
Plot No : 202,
IInd Floor ,
HUDA Maitrivanam,
Ameerpet, Hyderabad-500038
Ph.No : 09246212143.

Syllabus:

Data Structures

  •          Introduction
  •          Structured Representation
  •          Statements and Control Structures
  •          Abstract Data Types
  •          Static & Dynamic Data Types
  •          Arrays & Pointers
  •          Linked List
  •          Advanced Data Structures
  •          Data Structure Representation
  •          Analysis –Performance analysis of Time and Space
  •          Design : Algorithm and Flowchart
  •          Pseudo code
  •          Coding
  •          Asymptotic Notations-Use of Three Notations
  •          Counting Number of Operations of the Programs
  •          Order of Growth and Comparisons
  •          Testing

Stacks with Algorithms

  •          Defining stack
  •          Application of stack
  •          Conversion and Evaluation of Expressions
  •          Operations of stack
  •          Stack implemented as an array
  •          Stack implemented with pointers
  •          Using Stacks to solve problems

Queues with Algorithms

  •          Defining Queue
  •          Application of Queue
  •          Operation of Queue
  •          Circular Queue
  •          Priority Queue
  •          Double Ended Queue
  •          Queue implemented with Pointers
  •          Differences between Stacks and Queues

Linked List

  • Introduction
  • Advantages of Linked List over an Array
  • Application of Linked List
  • Types of Linked Lists
  • Singly Linked Lists
  • Operation of Singly Linked Lists
  • Doubly Linked Lists
  • Operations on Doubly Linked Lists
  • Circular Linked Lists
  • Circular Double Linked Lists
  • Uses of Linked Lists
  • Difference between Arrays and Linked List

Trees

  •          Introduction
  •          Binary Trees
  •          Implementation of Binary Trees
  •          Insertion into a Binary Tree
  •          Binary Tree Deletion
  •          Traversing a Binary Tree
  •          Binary Height Balanced Trees
  •          AVL Trees

Sorting Techniques with Order of Growth

  •          Introduction
  •          Bubble Sort
  •          Selection Sort
  •          Quick Sort
  •          Merge Sort
  •          Iterative Merge Sort
  •          Introduction to Heap
  •          Heap Operations
  •          Heap Sort

Searching Techniques

  • Introduction
  • Linear Search
  • Binary Search

Hashing Techniques

  • Introduction
  • Division Method
  • Mid Square Method
  • Folding Method
  • Hash Collision
  • Open Address

Graphs

  • Introduction
  • Types of Graphs
  • Various Representation of Graphs
  • Application of Graphs
  • Graph Traversals
  • Data Structure Question Papers Solving 

Note:The course content can be customized on Trees concept and any other algorithms according to the requirements of the attendees or college syllabus.

 

1. C,C++ & DS Expert Mr.Kiran Sir Now with DURGASOFT.