Analysis and Design of Algorithms
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesAnalysis and Design of Algorithms Syllabus — Unit-wise Content
The official GTU curriculum for Analysis and Design of Algorithms (subject code 3164503) as prescribed for CS-IoT · Semester 6 divides the course into 6 units, covering 48 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (3164503)Unit 1 Basics of Algorithms and Analysis of Algorithm
- What is an algorithm? Why to Analyse Algorithms? The efficient algorithm
- Best and Worst case analysis
- Asymptotic Notations
- Analysing control statement
- Loop invariant and the correctness of the algorithm
- Recurrence (Master Theorem only) Sorting Algorithms and analysis: Bubble sort
- Selection sort
- Insertion sort
- Heap sort
- Sorting in linear time : Bucket sort
- Radix sort and Counting sort
Unit 2 Divide and Conquer Algorithm
- Multiplying large Integers Problem
- Problem Solving using divide and conquer algorithm - Binary Search
- Max-Min problem
- Sorting (Merge Sort
- Quick Sort)
- Matrix Multiplication
- Subject Code : 3164503 Subject Name : Analysis and Design of Algorithms https://syllabus.gtu.ac.in/Page 2
Unit 3 Dynamic Programming
- The Principle of Optimality
- Problem Solving using Dynamic Programming – Calculating the Binomial Coefficient
- Making Change Problem
- Assembly Line-Scheduling
- Knapsack problem
- All Points Shortest path
- Matrix chain multiplication
- Longest Common Subsequence
Unit 4 Greedy Algorithm
- General Characteristics of greedy algorithms
- Problem solving using Greedy Algorithm
- Elements of Greedy Strategy
- Minimum Spanning trees (Kruskal’s algorithm
- Prim’s algorithm)
- Graphs: Shortest paths
- The Knapsack Problem
- Job Scheduling Problem
Unit 5 Exploring Graphs, Backtracking Technique
- An introduction using graphs and games
- Undirected Graph
- Directed Graph
- Traversing Graphs
- Depth First Search
- Breath First Search
- Topological sort
- Connected components
- Backtracking: Introduction
- The Eight queens problem
Unit 6 Introduction to NP-Completeness
- The class P and NP, Polynomial reduction
- NP- Completeness Problem
- NP-Hard Problems
- Approximation algorithms
Study on Android App:
