Data Structure

Course Description

The course covers the advance work of working with algorithms and creating pseudo code that will run on all the programming languages. In This Course, we start from the basics of Data structures, like Arrays, Stack, Queues, Linked List and then moves upto the dynamic memory management concepts of Trees and Graphs. We will focus on the algorithms Like Tree Traversal, Heap trees, AVL trees, Red Black Trees, BFS and DFS, Dijkstra, Prim and Kruskal Algorithm. We will then follow our journey to advance data structures with the concept of Divide and Conquer, Greedy Approach, Dynamic Programming and Branch And Bound Problems

We provide 6 weeks and 6 months course in Data Structures and provide the ISO certificate at the end of the course. At NCC, we also provide the complete guidance in building college level professional projects.

Learning Outcomes

• Over 45 Lectures and 6 tests
• Testing Training Included.
• Learn Data Structures and Algorithm Analysis from a professional trainer.
• Information packed practical training starting from basics to advanced testing techniques.
• Best suitable for beginners to advanced level users and who learn faster when demonstrated.
• Course content designed by considering current job market.
• Practical assignments at the end of every session.
• Practical learning experience with live project work and examples.

Data Structures Chapters in a glance

• Lecture 1.1 Programming in C and C++, and Introduction to Data Structures
• Lecture 1.2 Arrays, and operations on array. Building Algorithms
• Lecture 1.3 7 Sortings and 2 Searching Techniques Algorithm and programs
• Lecture 1.4 Time Complexity and Space Complexity Analyses
• Lecture 1.5 Asymptotic Notations, Big Oh, Big Theta and Big Omega Notations
• Lecture 1.6 Stack and Queues, Polish and Reverse Polish Notations
• Lecture 1.7 Linked List and its types.
• Lecture 1.8 Algorithm of Insertion , Deletion in singly and Doubly linked list
• Lecture 1.9 Stack and Queues Using Linked List
• Lecture 2.0 Trees Introduction and Tree Traversal
• Lecture 2.1 Heap trees, AVL Trees and Red Black Trees
• Lecture 2.2 Graphs and its types
• Lecture 2.3 BFS and DFS Algorthms, Creating Graph in Programs
• Lecture 3.0 Prim's Kruskal and Dijkstra Introduction and Programs
• Lecture 4.0 Introduction to Greedy Approach, Coin Change and Knapsack Problem
• Lecture 4.0 Introduction to Dynamic Programming, 0-1 Knapsack problem
• Lecture 4.0 Job Allocation Problem in Dynamic Programming
• Lecture 4.0 N-Queen Problem, Introduction to Branch and Bound