Algorithm analysis, sorting, graphs and complexity classes
Notes, papers, solutions, question banks, practical files and viva questions.
) Algorithm Fundamentals: Basic Concept, Analysis of Algorithm, Growth of Functions, Master’s Theorem.
Analysis of sorting Algorithms:
Overview, Merge sort, Quick sort, Heap sort, radix sort.
Advance Data Structure:
Red-Black Trees, B/B+ Trees.
Parallel Algorithm: Performance Measures of Parallel Algorithms, Parallel Merging/Sorting Algorithms on CREW/EREW, Parallel searching algorithms.
Advance Design and Analysis Techniques: Dynamic Programming, Greedy Algorithms, Branch and ound, Back Tracking.
Graph Algorithm: DFS and BFS algorithm.
NP Complete Problem
REFERENCES:
1. Coreman, Rivest, Lisserson, “Algorithm”, PHI.
2. Basse, “Computer Algorithms: Introduction to Design & Analysis”,Addision Wesley.
3. Horowitz, Sahani, and Rajasekaran “ Fundamental of Computer Algorithms”, Universities Press LAB-1: FOUNDATION OF COMPUTER SCIENCE (
As per the latest AKTU syllabus — cross-check electives with your college.
Where can I download Advanced Algorithm (MTCS102) notes for AKTU?
This page has upcoming Advanced Algorithm notes for AKTU M.Tech CSE semester 1, aligned with the latest AKTU syllabus. Free resources download instantly; premium ones unlock right after payment.
Are previous year question papers (PYQ) available for Advanced Algorithm?
PYQs for Advanced Algorithm (MTCS102) are being added. Meanwhile, check the notes and other resources on this page, and join our channel to get notified.
Which semester is Advanced Algorithm taught in for CSE?
Advanced Algorithm (MTCS102) is a semester 1 subject in the AKTU M.Tech Computer Science & Engineering (CSE) curriculum.
📚 New notes & PYQs — straight to your phone
Join our channel and get notified whenever we add material for your branch. Exam updates too.