Design and Analysis of Algorithm
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 UpdatesDesign and Analysis of Algorithm Syllabus — Unit-wise Content
The official GTU curriculum for Design and Analysis of Algorithm (subject code DI05031011) as prescribed for Chem. Green · Semester 5 divides the course into 5 units, covering 18 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 (DI05031011)Unit 1 Introduction to Algorithm and analysis of algorithm
- Definition of Algorithm: What is an algorithm
- Characteristics of an algorithm Types of Algorithms: Deterministic
- Recursive Algorithm Analysis: Efficiency of an algorithm Time Complexity and Space Complexity Best
- Worst, and Average Case Analysis Amortized Analysis Asymptotic Notations: O, Ω
- Θ Analyzing Control Structures: Examples of loops
- conditionals, and function calls Complexity Analysis of Basic Algorithms: Sorting: Bubble Sort
- Selection Sort
- Insertion Sort Searching: Sequential Search Matrix Operations: Addition
Unit 2 Divide and Conquer Algorithm
- Introduction and Characteristics Applications Recurrence Relations and Solution Methods: Substitution method
- Recursion Tree
- Master Theorem Problem Solving Using Divide and Conquer: Binary Search Sorting: Merge Sort
- Quick Sort Matrix Multiplication Complexity Analysis of Each Algorithm Program Name: Diploma Engineering Level: Diploma Branch: Computer Science and Engineering Subject Code: DI05031011 Subject Name: Design and Analysis of Algorithm Unit No
- Content No. of Hours % of Weightage
Unit 3 Dynamic Programming
- Introduction and Characteristics Principle of Optimality Applications Problem Solving Using Dynamic Programming: Binomial Coefficient Calculation Making Change Problem 0/1 Knapsack Problem Longest Common Subsequence
Unit 4 Greedy Algorithm
- General Characteristics of Greedy Algorithms Elements of Greedy Strategy Problem Solving Using Greedy Algorithm: Activity Selection Problem Minimum Spanning Trees: Kruskal’s and Prim’s Algorithm Making Change Problem Fractional Knapsack Problem
Unit 5 Exploring Graphs
- Introduction and Types of Graphs: Undirected
- Directed Graph Representation: Adjacency List
- Adjacency Matrix Graph Traversal Algorithms: Depth First Search (DFS) Breadth First Search (BFS) Topological Sorting Connected Components Detection
Study on Android App:
