Канал: Design And Analysis of Algorithms

Stack Implementation using Arrays

Stack Implementation using Arrays

Introduction to Stack Data Structure

Introduction to Stack Data Structure

Pointers

Pointers

Multidimensional Arrays/ Two Dimensional Arrays - Declaration, Initialization- Array Data Structure

Multidimensional Arrays/ Two Dimensional Arrays - Declaration, Initialization- Array Data Structure

1.3.5 Binary Search - Operations on Array Data Structure.

1.3.5 Binary Search - Operations on Array Data Structure.

1.3.4 Linear Search / Sequential Search - Operations on Arrays Data Structure

1.3.4 Linear Search / Sequential Search - Operations on Arrays Data Structure

1.3.3 Bubble Sort / Sinking Sort : Sorting Operation on Arrays Data Structure using C language.

1.3.3 Bubble Sort / Sinking Sort : Sorting Operation on Arrays Data Structure using C language.

1.3.2 Array Data Structure: Inserting and Deleting an item in array at particular position

1.3.2 Array Data Structure: Inserting and Deleting an item in array at particular position

1.3.1 Array Data Structure : One Dimensional Array - Declaration, Initialization, Traversing

1.3.1 Array Data Structure : One Dimensional Array - Declaration, Initialization, Traversing

1.1Classification of Data Structures / Primitive and Non Primitive Data Structures

1.1Classification of Data Structures / Primitive and Non Primitive Data Structures

Introduction to Data Structures

Introduction to Data Structures

Space Complexity / Space Efficiency of Algorithms - Performance Analysis part2

Space Complexity / Space Efficiency of Algorithms - Performance Analysis part2

Performance Analysis of Algorithms

Performance Analysis of Algorithms

2. Divide and Conquer - Introduction

2. Divide and Conquer - Introduction

1.6 Mathematical Analysis of Recursive Algorithms

1.6 Mathematical Analysis of Recursive Algorithms

1.5 Mathematical Analysis of Non Recursive Algorithms

1.5 Mathematical Analysis of Non Recursive Algorithms

1.4 Properties of Asymptotic Notations

1.4 Properties of Asymptotic Notations

1.3 Asymptotic Notations - Algorithm Analysis /Big O/ Big Omega / Big Theta

1.3 Asymptotic Notations - Algorithm Analysis /Big O/ Big Omega / Big Theta

1.2 Analysis Framework of Algorithms

1.2 Analysis Framework of Algorithms

1. Design and Analysis of Algorithms - Introduction

1. Design and Analysis of Algorithms - Introduction

1.1 What is an Algorithm? Algorithm specification

1.1 What is an Algorithm? Algorithm specification

5.9 VTU Previous Question Papers solved on Backtracking & Branch and bound (Module 5)

5.9 VTU Previous Question Papers solved on Backtracking & Branch and bound (Module 5)

5.8 P , NP , NP - HARD , NP - COMPLETE Problems

5.8 P , NP , NP - HARD , NP - COMPLETE Problems

5.7 Branch and Bound - Knapsack Problem

5.7 Branch and Bound - Knapsack Problem

5.6 Branch and Bound - Traveling Salesman Problem

5.6 Branch and Bound - Traveling Salesman Problem

5.5 Branch and Bound - Assignment problem

5.5 Branch and Bound - Assignment problem

5.4 Backtracking - Hamiltonian Cycles Problem

5.4 Backtracking - Hamiltonian Cycles Problem

5.3 Backtracking - Graph Coloring Problem

5.3 Backtracking - Graph Coloring Problem

5.2 Backtracking - Subset Sum problem

5.2 Backtracking - Subset Sum problem

5.1 Backtracking - NQueens Problem

5.1 Backtracking - NQueens Problem

5. Backtracking and Branch and Bound - Introduction

5. Backtracking and Branch and Bound - Introduction

4.10 Dynamic Programming - VTU Question Paper Solved1

4.10 Dynamic Programming - VTU Question Paper Solved1

4.9 Dynamic Programming - VTU Question Paper Solved2

4.9 Dynamic Programming - VTU Question Paper Solved2

4.8 Dynamic Programming - Multistage Graph

4.8 Dynamic Programming - Multistage Graph

4.7 Dynamic Programming - Reliability Design

4.7 Dynamic Programming - Reliability Design

4.6 Dynamic Programming - Traveling Salesman Problem

4.6 Dynamic Programming - Traveling Salesman Problem

4.5 Dynamic Programming - Single Source Shortest Paths - Bellman - Ford Algorithm

4.5 Dynamic Programming - Single Source Shortest Paths - Bellman - Ford Algorithm

4.4 Dynamic Programming - Knapsack Problem

4.4 Dynamic Programming - Knapsack Problem

4.3 Dynamic Programming - Optimal Binary Search Tree

4.3 Dynamic Programming - Optimal Binary Search Tree

4.2 Dynamic Programming - All Pair Shortest Path - Floyd's Algorithm

4.2 Dynamic Programming - All Pair Shortest Path - Floyd's Algorithm

4.1 Dynamic Programming - Transitive closure of Graph - Warshall's Algorithm

4.1 Dynamic Programming - Transitive closure of Graph - Warshall's Algorithm

4. Dynamic Programming - Introduction

4. Dynamic Programming - Introduction

3.9Greedy Method - VTU Question Paper Solved 2

3.9Greedy Method - VTU Question Paper Solved 2

3.8 Greedy Method - VTU Question Papers sovled1

3.8 Greedy Method - VTU Question Papers sovled1

3.7 Greedy Method - Job Sequencing with deadlines

3.7 Greedy Method - Job Sequencing with deadlines

3.6 Greedy Method - Knapsack Problem

3.6 Greedy Method - Knapsack Problem

3.5 Heap and HeapSort

3.5 Heap and HeapSort

3.4 Greedy Technique - Huffman Trees / Codes

3.4 Greedy Technique - Huffman Trees / Codes

3.3 Greedy Technique - Single Source Shortest path - Dijkstra's Algorithm

3.3 Greedy Technique - Single Source Shortest path - Dijkstra's Algorithm

3.2 Greedy Technique- Minimum Spanning tree - Prim's , Kruskal' Algorithm

3.2 Greedy Technique- Minimum Spanning tree - Prim's , Kruskal' Algorithm

3. Greedy Technique - Introduction

3. Greedy Technique - Introduction