Data Structures and Algorithms Training

Posted on Posted in Syllabus

Duration – 1 Month [MON-FRI]

Course Fee – INR 6000/-

*Attractive Group Discounts Available

Mode – In-Person (candidates of Hyderabad);  Same Live Class – Join Online (Outstation candidates)

 

Our Mission

Increase success rate of candidates (who are competent but lack proper guidance and direction) in cracking coding interviews of product based companies like Microsoft, Google, Amazon, Yahoo etc.

[dt_gap height=”20″]

Training Outcomes –  Learn to Crack Coding Interviews with Ease and Confidence

Successful completion of this training enables candidates to

  • Develop logical thought process to come up with multiple solutions to a given problem.
  • Translate idea, approach or logic into working code, with ease.
  • Gain confidence to Crack coding interviews/online coding rounds.
  • Realize optimized way to solve a problem through Analysis of Algorithms.
  • Apply data structures and algorithms knowledge to solve real world problems.

[dt_gap height=”20″]

Intended Audience

  • College students with passion and commitment to crack coding interviews to land up in their dream job.
  • College students aspiring to participate in online coding contests
  • Experienced programmers who want to crack Coding Interviews of product based companies.
  • Working Professionals looking for better opportunities in software product companies like Microsoft, Google, Amazon, Adobe etc.
  • Passionate programmers from any age group or industry want to improve their coding skills and build strong foundation in Data Structures and Algorithms.

[dt_gap height=”20″]

Course Syllabus

Module 1: Getting Ready for Problem Solving

Description

This module introduces basic tools that are necessary for problem solving.  Developing though process, ability to convert ideas to code, generating alternative solutions and selecting right solutions are the key goals of this module.  This module focuses on making candidates well versed with coding problems and interview questions in the areas of Loops, Arrays and Strings.   It provides a quick recap of programming concepts so that candidates build strong foundation in fundamental concepts and be better prepared to solve complex problems we would encounter in upcoming modules.

Topics Covered

[dt_list style=”1″ bullet_position=”middle” dividers=”false”]

[dt_list_item image=””]Creative Problem Solving Thought Process – Solve UVA 3n+1 Problem.[/dt_list_item]

[dt_list_item image=””]Quick Coverage of Programming Language Fundamentals[/dt_list_item]

[dt_list_item image=””]Solving medium to hard level problems involving – Arrays, Strings.[/dt_list_item]

[dt_list_item image=””]Programming Interview Questions – Thought Process, Analysis, Coding and Unit Testing.[/dt_list_item]

[dt_list_item image=””]Analysis of Algorithms.[/dt_list_item]

[dt_list_item image=””]Online Contest.[/dt_list_item]

[/dt_list]

Module 2:  Linear Data Structures and Applications

Description

This module helps us getting one further steps into problem solving.  We take a look at popular mobile and desktop games and understand how simple yet powerful linear data structures provide solid backbone for game programming.  This modules begins with coverage of most scary concept in programming world named POINTERS;  We not only master the concept of points but also learn to deal with Segmentation Faults and Crashes with ease and quickly fix such issues.

Topics Covered

[dt_list style=”1″ bullet_position=”middle” dividers=”false”]

[dt_list_item image=””]Pointers and their applications[/dt_list_item]

[dt_list_item image=””]Debugging applications – Learn to solve your problems independently.[/dt_list_item]

[dt_list_item image=””]Coverage of pointers, Vectors, Structure, Linked List, Stack, Queue.[/dt_list_item]

[dt_list_item image=””]Coding Data Strucutres from scratch – Vectors, Linked List, Stacks, Queue, Heaps.[/dt_list_item]

[dt_list_item image=””]Programming Interview Questions and Practical Applications.[/dt_list_item]

[dt_list_item image=””]Online Contest.[/dt_list_item]

[/dt_list]

Module 3: Efficient Search Structures and Algorithms – Trees and Tries

Description

Everyone in today’s world is searching for something, be it Job, College, Life Partner, Technical Answers, Political Answer or Information that he forgot or he never had.  Search engines empower us to do that.  So it is crucial to understand, how to search and how to make it more and more efficient.  This provides capability to find right information quickly to the learners and empowers them to not only understand the back bones of such solutions but also to apply to their own search needs.  This module introduces data structures that are efficient in searching.

Topics Covered

[dt_list style=”1″ bullet_position=”middle” dividers=”false”]

[dt_list_item image=””]Recursion, Sorting Algorithms, Search Algorithms.[/dt_list_item]

[dt_list_item image=””]Binary Trees, Binary Search Trees, Hashing and Tries, Backgracking[/dt_list_item]

[dt_list_item image=””]Coding Data Strucutres from scratch – Binary Search Trees, Tries.[/dt_list_item]

[dt_list_item image=””]Programming Interview Questions and Practical Applications.[/dt_list_item]

[dt_list_item image=””]Online Contest.[/dt_list_item]

[/dt_list]

Module 4:  Graphs, Bitwise Operators and AVL Trees

Description

If there is any data structure with huge set of practical applications and new algorithms invented and discovered everyday that is Graph.  Graph isn’t a most frequently asked interview topic asking candidate to code each and every aspect of graph but we believe it is important to cover graph as a data structures and two of the most important traversals using which most of the Graph problems can be solved.  There are enormous number of algorithms in graph and that requires a completely dedicated course for it;  So we cover this data structure in such a way that it enables candidate to face Graph related interview questions with confidence.

Topics Covered

[dt_list style=”1″ bullet_position=”middle” dividers=”false”]

[dt_list_item image=””]Graph Data Structures[/dt_list_item]

[dt_list_item image=””]Height Balanced BST – AVL Trees.[/dt_list_item]

[dt_list_item image=””]Bit wise operators and tips and tricks.[/dt_list_item]

[dt_list_item image=””]Coding Graph Strucutres from scratch – Implement BFS, DFS, Search and Print Path between nodes..[/dt_list_item]

[dt_list_item image=””]Practical Applications and Case Study – Social Network Problem..[/dt_list_item]

[dt_list_item image=””]A Project Assignment – Airlines Problem..[/dt_list_item]

[/dt_list]

[dt_testimonials type=”masonry” padding=”20″ orderby=”rand” order=”asc” column_width=”370″ number=”50″]