Bits N Pices
Sign in Start free
HomeCoursesDesign & Analysis of Algorithms
B.TechCSEITAIDSYear 2 · Semester 2Branch core

Design & Analysis of Algorithms

Study this course in Bits N Pices

Units · 7

  • Asymptotic analysis & recurrences
  • Divide & conquer
  • Greedy
  • Dynamic programming
  • Backtracking & branch-and-bound
  • Graph algorithms
  • NP-completeness

Project

Build a delivery-route optimiser and prove its bounds

B.Tech

Computer Science & Engineering

Quiz and flashcards

Test what you read and keep it with spaced repetition.

Bits AI

It answers about the book, the section, the quiz question you are on.

In the same program

See all courses
B.TechYear 2 · Semester 1
Discrete Mathematics6 units · Propositional & predicate logic
B.TechYear 2 · Semester 1
Digital Logic Design6 units · Number systems & codes
B.TechYear 2 · Semester 1
Object-Oriented Programming (Java)7 units · Classes, objects & constructors
B.TechYear 2 · Semester 2
Computer Organization & Architecture7 units · Basic structure & instruction sets
B.TechYear 2 · Semester 2
Database Management Systems7 units · Data models & ER design
B.TechYear 3 · Semester 1
Operating Systems7 units · OS structure & system calls