+91 8800580756, +91 7982391947
info@thelogicals.com
description
curriculum
reviews
About this course

This Course is prepared Software Professionals as well as Graduates who are willing to learn data structures and algorithm programming in simple and easy steps. Before proceeding with this course you should have basic knowledge of C/C++ OR Java.Data Structures are the programmatic way of storing data so that data can be used efficiently. Almost every enterprise application uses various types of data structures in one or the other way.

FAQs
Can I just enroll in a single course? I'm not interested in the entire course

Yes, One can enroll themself for one particular day as well based on their interested topics. Topics details are listed unter sylabus tab.

What is the refund policy?

We will refund the entire cost if candidate is not happy with training.

What background knowledge is necessary

We will be covering only algorithm in this course. Candidate should be familiar with either c/c++ OR Core Java concepts.

Do i need to take the courses in a specific order

One should be familiar with wny one of the programming languague. Knowing C/C++ OR java programming is must for this course.

Syllabus

There are two different types of data structure:
Linear Data Structure: In linear data structure data elements stored in sequential manner. Stack, Queue and Linked List are the types of linear data structure
Non Linear Data Structure: In Non-Linear data structure data elements are not stored in the sequence manner. Tree and Graph are the type of non-linear data structure.
We will be covering both linear and non linear data structure in this course.

Week 1
Total Session: 4
Basic concepts

Stack, Queue and LinkedList

  • Arrays
    • Basic Concepts
      60 minutes
    • Stack and Queues
      60 minutes
  • LinkedList
    • Basic Concepts
      60 minutes
    • Double LinkedList, Circular LinkedList
      60 minutes
  • Tests
    10 Questions
Week 2
Total Session:4
Topics Covered

Searching and sorting algorithm:

  • Searching Algorithm
    • Linear Search, Binary Search and Interpolation Search
      60 minutes
    • Hashing
      60 minutes
  • Sorting Algorithm
    • Insertion,Bubble and Selection Sorting
      60 minutes
    • Merge, Quick and Heap Sorting
      60 minutes
  • Tests
    10 Questions
Week 3
Total Session: 4
Topics Covered

Recursion

  • Recursion
    • Types, Basic Problems
      60 minutes
    • Intermediate problems
      60 minutes
    • Hard Problems
      60 minutes
  • Tests
    10 Questions
Week 4
Total Session: 4
About Topics

Tree Data Structure

  • Tree
    • Tree Traversal,Insertion, Deletion
      60 minutes
    • Binary Search Tree, AVL Tree, Spanning Tree
      60 minutes
    • MST, Prims Algorithm
      60 minutes
    • Kruksal and Boruvka Algorithm and Problems
      60 minutes
  • Tests
    10 Questions
Week 5
Total Session: 4
About Topic

Graph.

  • Graph
    • Graph Basic and Types
      60 minutes
    • BFS and DFS
      60 minutes
    • Topological Sorting , Dijkstras Shortest Path
      60 minutes
    • BellmanFord algorithm, Floyd Warshall Algorithm
      60 minutes
  • Tests
    10 Questions