Scribd
Upload
7 views2 pages

Advance Data Structure Algorithm SRIT

The document outlines a 12-day training program covering various algorithmic and data structure topics. It includes subjects such as sorting algorithms, dynamic programming, graph algorithms, tree structures, and mathematical concepts. Each day focuses on specific problems and techniques, providing a comprehensive curriculum for learning and practicing coding skills.

Uploaded by

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

Advance Data Structure Algorithm SRIT

The document outlines a 12-day training program covering various algorithmic and data structure topics. It includes subjects such as sorting algorithms, dynamic programming, graph algorithms, tree structures, and mathematical concepts. Each day focuses on specific problems and techniques, providing a comprehensive curriculum for learning and practicing coding skills.

Uploaded by

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

• Introduction

• Moving 0’s to end


Day 1 • Finding two sum (brute force, Hashmap, sorted array)
• Missing element in array(brute force, XOR, formula, hashing, sorting)
• Duplicate number (hashing modify array, sort, Hare Tortoise method)
• Missing and duplicate in array (2 methods)

• Selection sort, Insertion sort, Merge sort, Bubble sort


• Search in rotated sorted array
• First and last occurrence in array
Day 2 • Find peak element
• Count zeros
• Find index of extra element
• Find single element(XOR, binary search)
• Bit Manipulation (set, clear ,flip, return ith bit of binary number)
• Count set bit
• Power of 2
Day 3 • Even odd
• Power set
• Finding missing number
• Multiplication with out * operator
• Activity selection problem
• Job sequence problem
Day 4 • Max value permutation
• Max sum of obsolute difference (brute force, space optimization)
• Dynamic programming (Memoization, Tabulation)
• Knapsack problem
Day 5 • Subset problems
• No of subset with given difference
• Matrix Chain Multiplication
• Connect ropes minimize cost
• Unbounded knapsack
Day 6 • Target sum
• Rod cutting problem
• Coin change problems
• Longest common sub sequence
• Heaps(Basic tree concepts, Min-Heap, Max-Heap)
Day 7 • D-ary heaps
• - K-way merge algorithms
• - Heap Sort
• Graphs(Adjacency list/matrix, recursion)
• Dijkstra’s Algorithm (Shortest Path)
Day 8 • Bellman-Ford Algorithm (Shortest Path with Negative Weights
• Floyd-Warshall Algorithm (All-Pairs Shortest Path)
• Minimum Spanning Tree (Prim's and Kruskal’s)
• Trie (building)
Day 9 • Word Search
• Auto-suggestions
• Longest Common Prefix
• Trees (Balanced trees, AVL, Red-Black trees, B-trees.)
• Efficient searching, inserting, and deleting
• Lowest Common Ancestor (LCA)
• Count nodes, all traversals, height of tree
Day 10 • Zig zag traversal
• Mirror tree,
• Other questions on trees

• Segment Trees & Fenwick Tree


Day 11 • Efficient range queries and updates
• Range Sum Query (RSQ)
• Range Minimum Query (RMQ)
• Prime numbers, GCD, LCM, Modular Arithmetic,
• Modular arithmetic, prime numbers, and math basics.
Day 12 • sieve of Eratosthenes
•
•

You might also like