DSA for Placements using C Programming

Learn Data Structures & Algorithms Using C from an expert trainer & get ready for placement!

Special offer!

Data Structures and Algorithms are very important when it comes to programming/coding rounds during campus and off-campus placements. Service-Based or Product-based companies both specifically focus more on knowledge of Data Structures and Algorithms. It is very important when it comes to code implementation. This Data Structures & Algorithms Recorded Training will help all stream students to learn DSA programming right from the basics and help them crack programming rounds for all major companies.

Our DSA recorded lectures will guide you to learn different types of data structures and algorithms and their implementations in C programming

 

Features of the course:
  • 20 Hours of Recorded Course on Data Structure and Algorithms which you can access anytime.
  • Certification after completion of course
  • You can watch courses at any time on a laptop as well as mobile. It's a recorded course.
  • This course covers all you need to know about DSA even if you never programmed before!
Detailed Syllabus:

DSA Introduction

  • What is an algorithm?
  • Why learn algorithms?
  • Asymptotic Notations
  • Master Theorem
  • Divide and Conquer Algorithm

Data Structures (Part I)

  • Array
  • Stack
  • Queue
  • Types of Queue
  • Circular Queue
  • Priority Queue
  • Deque

Data Structures (Part II)

  • Linked List
  • Linked List Operations
  • Linked List Traversals
  • Types of Linked List
  • Hash Table
  • Heap Data Structure
  • Fibonacci Heap
  • Decrease Key and Delete a node from Fibonacci Heap

Tree-based DSA (Part I)

  • Tree Data Structure
  • Tree Traversal
  • Binary Tree
  • Full Binary Tree
  • Perfect Binary Tree
  • Complete Binary Tree
  • Balanced Binary Tree
  • Binary Search Tree
  • AVL Tree

Tree-based DSA (Part II)

  • B Tree
  • Insertion into B-tree
  • Deletion from B-tree
  • B+ Tree
  • Insertion on a B+ Tree
  • Deletion from a B+ Tree
  • Red Black Tree
  • Insertion in Red Black Tree
  • Deletion from Red Black Tree

Recursion

  • Introduction to Recursion
  • Tail Recursion
  • Natural Number Check using Recursion
  • Palindrome Check using Recursion
  • Tower of Hanoi

Hashing

  • Introduction to Hashing
  • Address Table
  • Collision Handling
  • Open Addressing
  • Double Hashing
  • Chaining v/s Open Addressing

Sorting and Searching Algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Counting Sort
  • Radix Sort
  • Bucket Sort
  • Heap Sort
  • Shell Sort
  • Linear Search
  • Binary Search

Greedy Algorithms

  • Greedy Algorithm
  • Ford-Fulkerson Algorithm
  • Dijkstra's Algorithm
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Huffman Code

For Doubts Contact Us on Whatsapp: +91-8459943139 or mail us at contact@talentbattle.in

Detailed Syllabus:

DSA Introduction

  • What is an algorithm?
  • Why learn algorithms?
  • Asymptotic Notations
  • Master Theorem
  • Divide and Conquer Algorithm

Data Structures (Part I)

  • Array
  • Stack
  • Queue
  • Types of Queue
  • Circular Queue
  • Priority Queue
  • Deque

Data Structures (Part II)

  • Linked List
  • Linked List Operations
  • Linked List Traversals
  • Types of Linked List
  • Hash Table
  • Heap Data Structure
  • Fibonacci Heap
  • Decrease Key and Delete a node from Fibonacci Heap

Tree-based DSA (Part I)

  • Tree Data Structure
  • Tree Traversal
  • Binary Tree
  • Full Binary Tree
  • Perfect Binary Tree
  • Complete Binary Tree
  • Balanced Binary Tree
  • Binary Search Tree
  • AVL Tree

Tree-based DSA (Part II)

  • B Tree
  • Insertion into B-tree
  • Deletion from B-tree
  • B+ Tree
  • Insertion on a B+ Tree
  • Deletion from a B+ Tree
  • Red Black Tree
  • Insertion in Red Black Tree
  • Deletion from Red Black Tree

Recursion

  • Introduction to Recursion
  • Tail Recursion
  • Natural Number Check using Recursion
  • Palindrome Check using Recursion
  • Tower of Hanoi

Hashing

  • Introduction to Hashing
  • Address Table
  • Collision Handling
  • Open Addressing
  • Double Hashing
  • Chaining v/s Open Addressing

Sorting and Searching Algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Counting Sort
  • Radix Sort
  • Bucket Sort
  • Heap Sort
  • Shell Sort
  • Linear Search
  • Binary Search

Greedy Algorithms

  • Greedy Algorithm
  • Ford-Fulkerson Algorithm
  • Dijkstra's Algorithm
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Huffman Code
DSA for Placements using C Programming
₹799 ₹599 
Buy Now
₹799 ₹599 
Buy Now

This package includes :

Courses

DSA for Placements using C Programming

DSA for Placements using C Programming

DSA with Placements using C Programming