Data Structure & Algorithm Basic to Advanced Course for CSE/IT Job Preparation

Uncategorized
Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

📌 āĻ•ā§‹āĻ°ā§āĻ¸ āĻŦāĻŋāĻŦāĻ°āĻŖ:

āĻĄā§‡āĻŸāĻž āĻ¸ā§āĻŸā§āĻ°āĻžāĻ•āĻšāĻžāĻ° āĻ“ āĻ…ā§āĻ¯āĻžāĻ˛āĻ—āĻ°āĻŋāĻĻāĻŽ āĻĒā§āĻ°ā§‹āĻ—ā§āĻ°āĻžāĻŽāĻŋāĻ‚ā§Ÿā§‡āĻ° āĻāĻ•āĻŸāĻŋ āĻŽā§āĻ˛āĻ­āĻŋāĻ¤ā§āĻ¤āĻŋ, āĻ¯āĻž āĻĻāĻ•ā§āĻˇ āĻ¸āĻĢāĻŸāĻ“ā§Ÿā§āĻ¯āĻžāĻ° āĻĄā§‡āĻ­ā§‡āĻ˛āĻĒāĻžāĻ° āĻŦāĻž āĻ•āĻŽā§āĻĒāĻŋāĻ‰āĻŸāĻžāĻ° āĻ¸āĻžā§Ÿā§‡āĻ¨ā§āĻ¸ āĻļāĻŋāĻ•ā§āĻˇāĻžāĻ°ā§āĻĨā§€āĻĻā§‡āĻ° āĻœāĻ¨ā§āĻ¯ āĻ…āĻĒāĻ°āĻŋāĻšāĻžāĻ°ā§āĻ¯āĨ¤ āĻāĻ‡ āĻ•ā§‹āĻ°ā§āĻ¸ā§‡āĻ° āĻŽāĻžāĻ§ā§āĻ¯āĻŽā§‡ āĻ†āĻĒāĻ¨āĻŋ āĻļāĻŋāĻ–āĻŦā§‡āĻ¨ āĻ•ā§€āĻ­āĻžāĻŦā§‡ āĻŦāĻŋāĻ­āĻŋāĻ¨ā§āĻ¨ āĻ§āĻ°āĻ¨ā§‡āĻ° āĻĄā§‡āĻŸāĻž āĻ¸āĻ‚āĻ—āĻ āĻŋāĻ¤ āĻ“ āĻĒāĻ°āĻŋāĻšāĻžāĻ˛āĻ¨āĻž āĻ•āĻ°āĻ¤ā§‡ āĻšā§Ÿ āĻāĻŦāĻ‚ āĻ•ā§€āĻ­āĻžāĻŦā§‡ āĻ•āĻžāĻ°ā§āĻ¯āĻ•āĻ°āĻ­āĻžāĻŦā§‡ āĻ¸āĻŽāĻ¸ā§āĻ¯āĻžāĻ° āĻ¸āĻŽāĻžāĻ§āĻžāĻ¨ āĻ•āĻ°āĻ¤ā§‡ āĻšā§Ÿ āĻ…ā§āĻ¯āĻžāĻ˛āĻ—āĻ°āĻŋāĻĻāĻŽ āĻŦā§āĻ¯āĻŦāĻšāĻžāĻ° āĻ•āĻ°ā§‡āĨ¤

đŸŽ¯ āĻ†āĻĒāĻ¨āĻŋ āĻ¯āĻž āĻļāĻŋāĻ–āĻŦā§‡āĻ¨:

  • āĻĄā§‡āĻŸāĻž āĻ¸ā§āĻŸā§āĻ°āĻžāĻ•āĻšāĻžāĻ°ā§‡āĻ° āĻ§āĻžāĻ°āĻŖāĻž (Array, Linked List, Stack, Queue, Tree, Graph āĻ‡āĻ¤ā§āĻ¯āĻžāĻĻāĻŋ)

  • āĻ…ā§āĻ¯āĻžāĻ˛āĻ—āĻ°āĻŋāĻĻāĻŽā§‡āĻ° āĻĒā§āĻ°āĻ•āĻžāĻ°āĻ­ā§‡āĻĻ (Searching, Sorting, Recursion, Greedy, Divide and Conquer, Dynamic Programming)

  • āĻŸāĻžāĻ‡āĻŽ āĻ“ āĻ¸ā§āĻĒā§‡āĻ¸ āĻ•āĻŽāĻĒā§āĻ˛ā§‡āĻ•ā§āĻ¸āĻŋāĻŸāĻŋ (Big-O Notation)

  • āĻŦāĻžāĻ¸ā§āĻ¤āĻŦ āĻœā§€āĻŦāĻ¨ā§‡āĻ° āĻ¸āĻŽāĻ¸ā§āĻ¯āĻžāĻ° āĻ¸āĻŽāĻžāĻ§āĻžāĻ¨ā§‡ āĻĄā§‡āĻŸāĻž āĻ¸ā§āĻŸā§āĻ°āĻžāĻ•āĻšāĻžāĻ° āĻ“ āĻ…ā§āĻ¯āĻžāĻ˛āĻ—āĻ°āĻŋāĻĻāĻŽā§‡āĻ° āĻŦā§āĻ¯āĻŦāĻšāĻžāĻ°

  • āĻ•āĻŋāĻ­āĻžāĻŦā§‡ āĻĒā§āĻ°ā§‹āĻ—ā§āĻ°āĻžāĻŽāĻŋāĻ‚ āĻ‡āĻ¨ā§āĻŸāĻžāĻ°āĻ­āĻŋāĻ‰āĻ¤ā§‡ āĻ­āĻžāĻ˛ā§‹ āĻ•āĻ°āĻŦā§‡āĻ¨

Show More

What Will You Learn?

  • đŸŽ¯ āĻ†āĻĒāĻ¨āĻŋ āĻ¯āĻž āĻļāĻŋāĻ–āĻŦā§‡āĻ¨:
  • ✅ āĻĄā§‡āĻŸāĻž āĻ¸ā§āĻŸā§āĻ°āĻžāĻ•āĻšāĻžāĻ°ā§‡āĻ° āĻŽā§ŒāĻ˛āĻŋāĻ• āĻ§āĻžāĻ°āĻŖāĻž
  • āĻĄā§‡āĻŸāĻž āĻ•ā§€āĻ­āĻžāĻŦā§‡ āĻ¸āĻ‚āĻ—āĻ āĻŋāĻ¤ āĻ“ āĻ¸āĻ‚āĻ°āĻ•ā§āĻˇāĻŋāĻ¤ āĻšā§Ÿ āĻ¤āĻž āĻœāĻžāĻ¨āĻ¤ā§‡ āĻĒāĻžāĻ°āĻŦā§‡āĻ¨ – āĻ¯ā§‡āĻŽāĻ¨:
  • Array
  • Linked List (Singly, Doubly, Circular)
  • Stack āĻ“ Queue (Linear, Circular, Priority)
  • Tree (Binary Tree, BST, AVL Tree, Heap)
  • Graph (DFS, BFS, Weighted/Unweighted)
  • Hashing āĻ“ Hash Table
  • ✅ āĻ…ā§āĻ¯āĻžāĻ˛āĻ—āĻ°āĻŋāĻĻāĻŽā§‡āĻ° āĻŦā§‡āĻ¸āĻŋāĻ• āĻĨā§‡āĻ•ā§‡ āĻ…ā§āĻ¯āĻžāĻĄāĻ­āĻžāĻ¨ā§āĻ¸
  • Searching Algorithms: Linear Search, Binary Search
  • Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort
  • Recursion āĻ“ āĻāĻ° āĻŦā§āĻ¯āĻŦāĻšāĻžāĻ°
  • Greedy Algorithms: Optimization Problem āĻ¸āĻŽāĻžāĻ§āĻžāĻ¨
  • Divide and Conquer: āĻŦā§œ āĻ¸āĻŽāĻ¸ā§āĻ¯āĻžāĻ•ā§‡ āĻ›ā§‹āĻŸ āĻ…āĻ‚āĻļā§‡ āĻ­āĻžāĻ— āĻ•āĻ°ā§‡ āĻ¸āĻŽāĻžāĻ§āĻžāĻ¨
  • Backtracking: Puzzle/Combination āĻ¸āĻŽāĻ¸ā§āĻ¯āĻžā§Ÿ āĻŦā§āĻ¯āĻŦāĻšāĻžāĻ°

Course Content

Data Structure

  • Basic Operation of Data structure | Types of DS | data vs information | memory calculation
    00:00
  • Array related math solution | Row major & Column Major | Types of Array | Advantage of array
    00:00
  • Heap tree | Max heap construction | Min heap construction | max-min heap algorithm
    00:00
  • What is STACK | PUSH and POP algorithm | Implementation of STACK | Application of STACK
    00:00
  • Postfix expression evaluation using STACK | Data structure and algorithm | Very easy process
    00:00
  • Algorithm for infix to postfix expression using Stack | Stack implementation | with example
    00:00
  • Queue in Data Structure | Enqueue & Dequeue Operation | Complexity of Queue | Application of Queue
    00:00
  • Properties of Tree | Height, Depth, Level | Application of Tree | IT Job Solution | Data Structure
    00:00
  • Tree Traversing | Pre Order | In Order | Post Order | Data Structure | IT Job Solution
    00:00

Student Ratings & Reviews

No Review Yet
No Review Yet