Tutorialspoint

MEGA SKILL MARATHON | FLAT 10% OFF | Use: MEGA10

MSC Semester I - DESIGN AND ANALYSIS OF ALGORITHMS (DS)

person icon Tutorialspoint

4.2

MSC Semester I - DESIGN AND ANALYSIS OF ALGORITHMS (DS)

MSC Semester I - DESIGN AND ANALYSIS OF ALGORITHMS

updated on icon Updated on Feb, 2026

language icon Language - English

person icon Tutorialspoint

category icon Programming,Data Science,Data Analysis

Lectures -186

Resources -10

Duration -17.5 hours

Lifetime Access

4.2

price-loader

Lifetime Access

30-days Money-Back Guarantee

Training 5 or more people ?

Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.

Course Description

UNIT – I: INTRODUCTION TO ALGORITHMS
Algorithm Specification; Performance Analysis; Randomized Algorithms.
Elementary Data Structures: Stacks and Queues; Trees; Dictionaries; Priority Queues; Sets and Disjoint Set Union; Graphs.
Divide and Conquer: Binary Search; Finding the Maximum and Minimum; Merge Sort; Quick Sort; Selection Sort; Strassen's Matrix Multiplication; Convex Hull.
UNIT – II: GREEDY METHOD AND DYNAMIC PROGRAMMING
Greedy Method: Knapsack Problem; Job Sequencing with Deadlines; Minimum-Cost Spanning Trees (Kruskal's & Prim's); Single Source Shortest Paths (Dijkstra's).
Dynamic Programming: General Method; Multistage Graphs; All-Pairs Shortest Paths; Single-Source Shortest Paths; Optimal Binary Search Trees; 0/1 Knapsack; Travelling Salesperson Problem.
UNIT – III: TRAVERSAL TECHNIQUES, BACKTRACKING AND BRANCH-AND-BOUND
Basic Traversal and Search Techniques: Techniques for Binary Trees; Techniques for Graphs; Connected Components and Spanning Trees; Biconnected Components; DFS.
Backtracking: General Method; 8-Queens Problem; Sum of Subsets; Graph Colouring; Hamiltonian Cycles; Knapsack Problem.
Branch-and-Bound: General Method; 0/1 Knapsack Problem; Travelling Salesperson Problem.
UNIT – IV: NP-HARD AND NP-COMPLETE PROBLEMS
Basic Concepts; Cook's Theorem; NP-Hard Graph Problems; NP-Hard Scheduling Problems; NP-Hard Code Generation; Some Simplified NP-Hard Problems.

MSC Semester I - DESIGN AND ANALYSIS OF ALGORITHMS (DS)

Curriculum

Check out the detailed breakdown of what’s inside the course

Introduction to Data Structures and Algorithms

22 Lectures
  • play icon Recursion Introduction 06:40 06:40
  • play icon 15.3.1. Algorithm run time- Introduction 1 05:28 05:28
  • play icon Introduction of DSA 04:39 04:39
  • play icon Why Recursion? 02:31 02:31
  • play icon 15.3.1. Algorithm run time- Introduction 2 04:31 04:31
  • play icon Introduction to DSA- Part 2 04:26 04:26
  • play icon Format used and Internal working of Recursion 02:48 02:48
  • play icon Time complexity 04:40 04:40
  • play icon Introduction to DSA- Part 3 04:17 04:17
  • play icon Examples of Recursion 04:20 04:20
  • play icon Example of Implementation - Part 1 02:11 02:11
  • play icon Introduction to DSA- Part 4 01:57 01:57
  • play icon Recursion vs Iteration 02:25 02:25
  • play icon Example of Implementation - Part 2 02:41 02:41
  • play icon Introduction to DSA- Part 5 02:47 02:47
  • play icon Advantage and Disadvantages of Recursion 03:52 03:52
  • play icon Example of Implementation - Part 3 02:25 02:25
  • play icon Introduction to DSA- Part 6 01:57 01:57
  • play icon Recursion Implementation- Part 1 03:57 03:57
  • play icon Python Implementation 07:10 07:10
  • play icon Recursion Implementation- Part 2 05:50 05:50
  • play icon Search in Recursion Implementation 18:31 18:31

Algorithm Runtimes

7 Lectures
Tutorialspoint

Linear Datastructures

45 Lectures
Tutorialspoint

Non - Linear Data structures

46 Lectures
Tutorialspoint

Concept of Binary Heaps

10 Lectures
Tutorialspoint

Hashing and Sorting

26 Lectures
Tutorialspoint

Advance Data structure

30 Lectures
Tutorialspoint

Instructor Details

Tutorialspoint

Tutorialspoint

Simple and Easy Learning


Tutorials Point originated from the idea that there exists a class of readers who respond better to online content and prefer to learn new skills at their own pace from the comforts of their drawing rooms.

The journey commenced with a single tutorial on HTML in 2006 and elated by the response it generated, we worked our way to adding fresh tutorials to our repository which now proudly flaunts a wealth of tutorials and allied articles on topics ranging from programming languages to web designing to academics and much more.

40 million readers read 100 million pages every month

Our Text Library Content and resources are freely available and we prefer to keep it that way to encourage our readers acquire as many skills as they would like to. We don't force our readers to sign up with us or submit their details either to use our Free Text Tutorials Library. No preconditions and no impediments, Just Simply Easy Learning!

We have established a Digital Content Marketplace to sell Video Courses and eBooks at a very nominal cost. You will have to register with us to avail these premium services.

Course Certificate

Use your certificate to make a career change or to advance in your current career.

sample Tutorialspoint certificate

Our students work
with the Best

Related Video Courses

View More

Annual Membership

Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses

Subscribe now
Annual Membership

Online Certifications

Master prominent technologies at full length and become a valued certified professional.

Explore Now
Online Certifications

Talk to us

1800-202-0515