KICIT Pvt Ltd / KSET Pvt Ltd

Data Structures Thro. C++ Course

KICIT Pvt Ltd / KSET Pvt Ltd
In Nagpur

Price on request
You can also call the Study Centre

Important information

Typology Course
Location Nagpur
Duration 1 Day
  • Course
  • Nagpur
  • Duration:
    1 Day
Description

Facilities (1)
Where and when

Location

Starts

Nagpur (Maharashtra)
See map
44A Hill Road Gokulpeth, 440010

Starts

On request

Questions & Answers

Ask a question and other users will answer you

Who do you want to respond to your question/enquiry?

We will only publish your name and question

Course programme

Data structures is a basic issue in advanced Computer Science. All computer programmers and developers must be well versed with Data structure. The training program assists you know the design, implementation and analysis of Data Structures Thro. C++.

Course Content
In this training program candidates will learn about following topics:

* Intro to Data Structures
* Understand Linear & Binary Search
* Search & Frequency Count
* Analysis of Search Methods
* Understand Hashing Methods
* Learn Sorting Methods
* Understand Sorting & Recursion
* Understand Quick sort Algorithm
* Learn Structures
* Polynomials
* Two dimensional Arrays
* The sparse matrices
* Implementation of sparse matrices
* The addition of sparse matrices
* Understand Multiplication of sparse matrices
* Learn Storage Arrays
* Dynamic Memory Allocation
* Learn Procedural Programming
* Understand Object-Oriented Solution
* Learn Classes in C + +
* this pointer
* The access specifiers & Constructor
* Understand Function Overloading
* Constructors
* Learn types of Constructors
* Understand Operator Overloading
* Pre, Post & references Incr
* Learn More About References
* Dynamic Memory Allocation - Ist Part
* Dynamic Memory Allocation - IInd Part
* Static members
* Learn Reuse Mechanisms
* Containers & Inheritance
* Virtual Functions
* Understand Linked List
* Operations in a linked list
* Linked Ascending Order List
* Investment and merge linked list
* Linked list & polynomials
* Understand Circular Linked List
* Understand Doubly linked list
* Stack
* Stack as Linked List
* Understand stack & expressions
* Infix to Post-fix using stack
* Understand Post-fix Evaluation
* Queue
* Circular Queue
* De-queue & priority queue
* Trees Binary Search - Ist Part
* Trees Binary Search - IInd Part
* Intro to Trees
* Introduction to Binary Tree
* Tree Traversal
* Graphic
* Adjacency MultiList
* Depth First Search
* Breadth First Search
* Spanning Tree
* Dijkstra Algorithm


Compare to choose better:
See all