Recently added

UNIT V BACKTRACKING AND BRANCH-AND-BOUND Backtracking – N-Queens Problem – Hamiltonian Circuit Problem – Subset Sum Problem – Branch-and- Bound – Travelling Salesman Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

Unknown author (GALGOTIAS UNIVERSITY, 2019)

UNIT IV GREEDY TECHNIQUE-Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

. (GALGOTIAS UNIVERSITY, 2019)

Dynamic Programming

. (GALGOTIAS UNIVERSITY, 2019)

Dynamic Programming, Unit III

. (GALGOTIAS UNIVERSITY, 2019)

Dynamic Programming, Unit III

. (GALGOTIAS UNIVERSITY, 2019)

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II - DIVIDE-AND-CONQUER-Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

DIVIDE-AND-CONQUER Divide and Conquer Methodology-UNIT II – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

Dr. Sasikumar Periyannan (GALGOTIAS UNIVERSITY, 2019)

B.SC., (HONS) COMPUTER SCIENCE: Recent submissions

UNIT V BACKTRACKING AND BRANCH-AND-BOUND Backtracking – N-Queens Problem – Hamiltonian Circuit Problem – Subset Sum Problem – Branch-and- Bound – Travelling Salesman Problem ﻿

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem ﻿

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem ﻿

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem ﻿

UNIT IV GREEDY TECHNIQUE-Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem ﻿

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem ﻿

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem ﻿

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem ﻿

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem ﻿

Dynamic Programming ﻿

Dynamic Programming, Unit III ﻿

Dynamic Programming, Unit III ﻿

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II - DIVIDE-AND-CONQUER-Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

DIVIDE-AND-CONQUER Divide and Conquer Methodology-UNIT II – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication ﻿

UNIT V BACKTRACKING AND BRANCH-AND-BOUND Backtracking – N-Queens Problem – Hamiltonian Circuit Problem – Subset Sum Problem – Branch-and- Bound – Travelling Salesman Problem

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

UNIT IV GREEDY TECHNIQUE-Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

UNIT IV GREEDY TECHNIQUE- Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

UNIT III DYNAMIC PROGRAMMING: Dynamic Programming – Change-making Problem – Computing a Binomial Coefficient – All-pairs Shortest paths Problem – Warshall’s and Floyd’s Algorithms – 0/1 Knapsack Problem

Dynamic Programming

Dynamic Programming, Unit III

Dynamic Programming, Unit III

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II - DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II - DIVIDE-AND-CONQUER-Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

UNIT II DIVIDE-AND-CONQUER Divide and Conquer Methodology – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication

DIVIDE-AND-CONQUER Divide and Conquer Methodology-UNIT II – Binary Search – Merge Sort – Quick Sort – Heap Sort – Multiplication of Large Integers – Strassen’s Matrix Multiplication