₹8,177.00
Description
Topics covered in the course includes: data abstraction, a survey of linear data structures, nonlinear data structures, a discussion of more advanced internal and external sort and search algorithms, and The algorithm analysis and trade-offs study shall be done. Implementations and their efficiency in C Language shall be considered in the implementation.
This course is encapsulated with following key materials –
- Warm up on the concepts with topic-wise tutorials.
- Prepare with comprehensive Topic-wise tutorial Materials.
- Data abstraction and information hiding.
- Linear data structures and their applications in problem solving and programming.
- Nonlinear data structures and their applications in problem solving and programming.
- Internal and external sort and search techniques.
- Highly Qualified and Experience Technical Team to help each trainee.
- Small Batch Size for focused Learning analysing the keeping in mind the career path of the student.
Prerequisites
- C Programming
- Willingness to improve and compete with the best.
- Curiosity to learn more and code.
Key Learning Outcomes:
When you complete this Course Curriculum, you will be able to accomplish the following:
- Crack placement of Top-Tier IT companies.
- Career enhancement and advancement.
- New ways of solving problems, and the ability to solve more complex problems.
- Finding algorithmically fast solutions.
- Writing bug-free code.
Target Audience:
- Students who want to get selected in Top-Tier IT Companies like TCS, Infosys, Microsoft, Samsung, Wipro and all leading MNC’s of the world.
- Students who wish to compete, crack and win Coding Competitions by improving their logic and programming skills
- Students who want to learn different Problem-Solving Approach.
- M.Tech/B.Tech/MCA/BCA/Any Graduate or Diploma Holder
Test & Evaluation
- During the program, the participants will have to take all assignments given to them for better learning.
- At the end of the program, a final assessment will be conducted
Certification
- All successful participants will be provided with a certificate of completion.
- Students who do not complete the course / leave it midway will not be awarded any certificate.
Delivery Mode & Duration :
Online Live Mode – 120 Hours (60 Hours Online Live sessions + 60 Hours of assignment)
Module 1 – An Introduction to Data Structure
- Introduction to Data and Data Structure
- Types of Data Structure
- Primitive and Non-Primitive Data Structure
- Algorithms, Pseudo Code, Program
- Performance analysis and Measurement
- Time Complexity
- Space Complexity
- Big O Notation
Module 2 – Function, Recursion and Array
- Function:
- What is function
- Types of function
- How function works
- Function recursion and how it works.
- Types of Recursion
- Array
- Introduction to Array
- Types of Array
- Sigle Dimension, Multi Dimension Array
- Array with Function
- Array Notation and Pointer Notation
Module 3 – Pointer, Memory Allocation, Segmentation and Array
- Pointer Introduction
- Size and Scale of Pointer
- Generic and Constant Pointer
- Memory Allocation
- Types of Memory Allocation
- Static Memory Allocation
- Dynamic Memory Allocation
- Malloc(), calloc(), realloc() ,free()
- Memory Segmentation
- Stack
- Heap
- Data
- Code
- Storage Class
- Auto
- register
- Static
- Extern
Module 4 – Structure and Linked Lists
- Structure
- Structure using structure
- Nested Structure
- Anonymous Structure
- Self-Referential Structure
- Linked List Introduction
- Operations on Linked List
- Types of Linked List
- Singly Linked List
- Double Linked List
- Circular Linked List
- Circular doubly Linked List
- Applications of Linked List
Module 5 – Stack
- Stack Introduction
- Stack Implementation
- Static Implementation (Array)
- Dynamic Implementation (Pointer)
- Applications of Stack
- Polish Notations
Module 6 – Queue
- Queue Introduction
- Queue Implementation
- Static Implementation (Array)
- Dynamic Implementation (Pointer)
- Circular Queue, Double Ended Queue, Priority Queue
- Applications of Queue
Module 7 – Trees
- Tree Introduction
- Tree Terminology
- Binary Tree
- Strictly Binary Tree
- Complete Binary Tree
- Extended Binary Tree
- Binary Tree Representation
- Binary Tree Traversal
- PreOrder
- Inorder
- PostOrder
- Expression Tree
- Binary Search Tree
- Height Balanced Tree (AVL Tree )
Module 8 – Graphs
- Graph Definition
- Graph Terminology
- Graph Representation
- Adjacency Matrix
- Adjacency List Representation
- Graph Traversal
- Breadth First Traversal
- Depth First Traversal
- Minimal Spanning Tree
Module 9 – Sorting and Searching
- Sorting Introduction
- Sorting Techniques
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Merge Sort
- Heap Sort
- Searching Techniques
- Linear Search
- Binary Search