Scribd
Upload
3 views2 pages

DSA-Vignan - Python 4

The document outlines a 18-day training program covering various data structures and algorithms, including linked lists, stacks, queues, hashing, backtracking, trees, graphs, heaps, greedy algorithms, and dynamic programming. Each day focuses on specific topics, practical applications, and problem-solving using platforms like LeetCode and GFG. The curriculum includes theoretical concepts, programming techniques, and company-specific problems to enhance understanding and application of the subjects.

Uploaded by

invologicsoftwareservices
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views2 pages

DSA-Vignan - Python 4

The document outlines a 18-day training program covering various data structures and algorithms, including linked lists, stacks, queues, hashing, backtracking, trees, graphs, heaps, greedy algorithms, and dynamic programming. Each day focuses on specific topics, practical applications, and problem-solving using platforms like LeetCode and GFG. The curriculum includes theoretical concepts, programming techniques, and company-specific problems to enhance understanding and application of the subjects.

Uploaded by

invologicsoftwareservices
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Day Topics to be discussed

Day 1 Linked list related programs using Leet code and GFG
Day 2  Stack using array and applications
 Stack using linked list
 Pre-defined stack class in collections
 Stack related programs using Leet code and GFG
Day 3  Queue using array and application
 Queue using linked list
 Operation of Queue
 Circular Queue
 Priority Queue
 Double Ended Queue
Queue related programs
Day 4 What is Hashing?, Why Hashing?, HashTable ADT, Understanding
Hashing, Components of Hashing, Hash Table, Hash Function,
Hashing Techniques, Hashing: Problems & Solutions
Day 5 Backtracking
What is Backtracking?
 Backtracking: Problems & Solutions, Maze Problems, N
Queens Problem, Subset Sum, m Coloring Problem
Day 6  Backtracking programs using Leet code and GFG
Day 7 Trees

 Tree terminology
 Types of binary tree
 Binary trees
 Construction of Binary tree
Binary tree related programs
Day 8  Binary Search Tree
 Insert a node in Binary Search Tree
 Tree traversal methods
 Search a node in Binary Search Tree
 Delete a node in Binary Search Tree
BST related programs
Day 9 Tree related company specific programs using leet code and GFG
Day 10 Graph Basics Degree of Vertex, Adjacency matrix representation of
graph,
Implementation of Adjacency Matrix, Adjacency list representation
of graph, Implementation of Adjacency list, Adjacency matrix Vs
Adjacency list representation
Delete a node, delete edge operations
Day 11 Breadth First Search(BFS), Depth First Search (DFS)
 BFS and DFS related programs
Day 12  Previously asked programs and Leet code and GFG
Day 13  Heaps and Binary Heaps, Binary Heaps, Priority Queues
[Heaps]: Problems & Solutions
Leet code Programs
Day 14 Introduction, Greedy Strategy, Elements of Greedy Algorithms,
Advantages and Disadvantages of Greedy Method, Greedy
Applications, Greedy Algorithms: Problems & Solutions
Day 15 Leet code and GFG programs for Greedy
Day 16 Introduction, What is Dynamic Programming Strategy?, Dynamic
Programming Approaches, Examples of Dynamic Programming
Algorithms, Dynamic Programming: Problems & Solutions, Longest
Common Subsequence, Longest Increasing Subsequence, Edit
Distance, Minimum Partition, Ways to Cover a Distance, Longest
Path In Matrix, Subset Sum Problem
Day 17 0-1 Knapsack Problem, Assembly Line Scheduling, Optimal Binary
Search Tree, Traveling salesman, Coin change problem, Compare
Divide and conquer, Greedy and Dynamic Programming strategies
Day 18 Introduction, String Matching Algorithms, Brute Force Method,
Rabin-Karp String Matching Algorithm, String Matching

You might also like