Scribd
Upload
38 views2 pages

Data Structure Project (CS 351)

This document outlines the topics of a data structures project course (CS 351) including: 1) asymptotic analysis and algorithm analysis techniques, 2) divide and conquer algorithms like binary search, quicksort, and merge sort, 3) dynamic programming techniques and applications to problems like coin change, subset sum, and longest common subsequence, 4) greedy algorithms and applications to problems like job sequencing and Huffman coding, and 5) backtracking techniques and applications to problems like the N-queen problem, knight's tour problem, and sudoku.

Uploaded by

ASTHA SINGH
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
38 views2 pages

Data Structure Project (CS 351)

This document outlines the topics of a data structures project course (CS 351) including: 1) asymptotic analysis and algorithm analysis techniques, 2) divide and conquer algorithms like binary search, quicksort, and merge sort, 3) dynamic programming techniques and applications to problems like coin change, subset sum, and longest common subsequence, 4) greedy algorithms and applications to problems like job sequencing and Huffman coding, and 5) backtracking techniques and applications to problems like the N-queen problem, knight's tour problem, and sudoku.

Uploaded by

ASTHA SINGH
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

Data Structure Project(CS 351)

1. Asymptotic Analysis
1.1 ​Asymptotic Analysis
1.2 ​Asymptotic Notations
1.3 ​Analysis of Loops
1.4 ​What does ‘Space Complexity’ mean?
1.5 ​Little o and little omega notations
1.6 All the video lectures of Abdul Bari from 1.5 to 1.11
2. Divide & Conquer Approach
2.1 ​Binary Search
2.2 ​ Q
​ uicksort
2.3 ​ M​ erge Sort
2.4 ​ C ​ losest Pair of Points
2.5 ​ S ​ trassen’s Algorithm
2.6 ​ K ​ aratsuba algorithm for fast multiplication
2.7 ​Divide and Conquer (D & C) vs Dynamic Programming (DP) 
3. Dynamic Programming
3.1 ​Tabulation vs Memoizatation
3.2 ​Optimal Substructure Property
3.3 ​Overlapping Subproblems Property
3.4 ​How to solve a Dynamic Programming Problem ?
3.5 ​Coin change problem
3.6 ​Subset Sum Problem
3.7 ​Longest Common Subsequence
4. Greedy Approach
4.1 ​Standard Greedy Algorithms
4.2 ​Job Sequencing Problem
4.3 ​Huffman Coding
4.4 ​Job Sequencing Problem – Loss Minimization
4.5 ​Egyptian Fraction
4.6 ​Huffman Decoding
4.7 ​Policemen catch thieves
5. Backtracking
5.1 ​Standard Problems
5.2 ​N Queen Problem
5.3 ​The Knight’s tour problem
5.4 ​m Coloring Problem
5.5 ​Sudoku
5.6 ​Rat in a Maze
5.7 ​Subset Sum

You might also like