Shivaji University, Maharashtra, Computer Engineering Semester 5, Computer Algorithm Syllabus

Computer Algorithm Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Introduction

1.1 Algorithm

1.2 Definition of Algorithm


1.4 Asymptotic Notation

1.5 Heap Data Structure

Unit - 2 Divide and Conquer

2.1 Divide and conquer

2.2 Binary Search Algorithm

2.3 Merge Sort Algorithm


2.5 Quick Sort Algorithm

2.6 Analysis of Quick Sort Algorithm

Unit - 3 The Greedy Method

3.1 Greedy Method

3.2 Fractional Knapsack Problem

3.3 Job Sequencing Algorithm

3.4 Prim’s Algorithm

3.5 Kruscal’s Algorithm

3.6 Dijikstra’sAlgorithmSingle Source Shortest Path

3.7 Optimal Storage Problem on Tapes

Unit - 4 Dynamic Programming

4.1 Dynamic programing

4.2 Optimal binary search tree

4.3 01 knapsack problem

4.4 Travelling salesman problem

4.5 Floyd’s algorithm all pair shortest path

4.6 Multistage Graph

4.7 Reliability Design

Unit - 5 Backtracking

5.1 Backtracking

5.2 8Queen problem

5.3 Sum of Subset

5.4 Knapsack Problem

5.5 Hamilton Cycle

5.6 Graph Coloring Algorithm

Unit - 6 Basic Traversal and Search Techniques and Polynomial Problems

6.1 Binary Tree

6.2 Game Tree

6.3 Graph Traversal and Searching Algorithms

6.4 ANDOR Graph

6.5 Connected Components

6.6 Spanning Tree

6.7 BiConnected Components

6.8 NP Hard Class

6.9 NPComplete Class

Download CSE Sem 5 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Operating system-i
System programming
Software engineering
Computer graphics and multimedia techniques
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us