Design and Analysis of Algorithm (B.Tech)

Algorithm analysis, divide and conquer, greedy, dynamic programming, backtracking and NP-completeness.

6 महीनेअवधि 5Chapters24टॉपिक

अभी पूछताछ करें

सिलेबस · पाठ्यक्रम

Download PDF

01Unit 1: Introduction, Sorting and Recurrences 5 टॉपिक

Algorithms, analysis and growth of functions
Shell sort, quick sort, merge sort and heap sort
Comparison of sorting algorithms
Sorting in linear time: counting, radix, bucket sort
Recurrences: substitution, recursion tree and master method

02Unit 2: Advanced Data Structures 5 टॉपिक

Red-black trees
B-trees
Binomial heaps
Fibonacci heaps
Tries and skip lists

03Unit 3: Divide and Conquer and Greedy Methods 4 टॉपिक

Divide and conquer: sorting, searching, Strassen's matrix multiplication, convex hull
Greedy method: fractional knapsack, optimal reliability allocation
Minimum spanning trees: Prim's and Kruskal's
Single-source shortest paths: Dijkstra's and Bellman-Ford

04Unit 4: Dynamic Programming, Backtracking and Branch and Bound 5 टॉपिक

Dynamic programming: 0/1 knapsack, LCS, matrix chain multiplication
All-pairs shortest paths: Warshall's and Floyd's
Resource allocation problem
Backtracking: n-queens, graph colouring, Hamiltonian cycle, sum of subsets
Branch and bound: travelling salesman problem

05Unit 5: Selected Topics 5 टॉपिक

Algebraic computation and fast Fourier transform
String matching: naive, Rabin-Karp, KMP
P, NP, NP-hard and NP-complete problems
Approximation algorithms
Randomised algorithms

परिचय

आप यह कर पाएँगे

Analyse algorithms using asymptotic notations and solve recurrences (substitution, recursion tree, master method)
Compare comparison-based and linear-time sorting algorithms
Explain red-black trees, B-trees, binomial and Fibonacci heaps, tries and skip lists
Design divide-and-conquer and greedy algorithms (knapsack, MST, shortest paths)
Solve problems with dynamic programming, backtracking and branch and bound
Explain string matching, FFT, NP-completeness, approximation and randomised algorithms

यह किसके लिए है

B.Tech Computer Science & Engineering, Information Technology students of Semester 5 (AKTU)
Students of other universities studying the same subject who want unit-wise coaching

आपको क्या चाहिए

Data Structure (Semester 3)
Discrete mathematics and C / C++ / Java programming

सवाल

Which syllabus does the Design and Analysis of Algorithm course follow?

It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Design and Analysis of Algorithm. If your own university's syllabus differs, the centre follows your university syllabus.

Will this help in the university examination?

Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.

Are algorithms traced step by step?

Yes. Every algorithm is traced on an example (tables, trees, graphs) the way AKTU asks it in the exam, along with its complexity.