Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Work planकार्य योजनाStep by step with your guide / trainer.
Sorting and SearchingDivide and ConquerGreedy AlgorithmsDynamic ProgrammingBacktrackingGraph Algorithms
- 3
File, report & vivaफ़ाइल, रिपोर्ट और वाइवाPractical file / report checked, mock viva before the final one.
- 4
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
सिलेबस · पाठ्यक्रम
1 subject · 6 chapters · 23 topics
01Sorting and Searching
4 टॉपिक+
- Insertion, selection and heap sort
- Counting sort
- Linear and binary search
- Measuring running time for n = 1000 to 10000
02Divide and Conquer
4 टॉपिक+
- Merge sort
- Quick sort with randomised pivot
- Finding maximum and minimum
- Strassen's matrix multiplication
03Greedy Algorithms
4 टॉपिक+
- Fractional knapsack
- Activity selection
- Prim's minimum spanning tree
- Kruskal's minimum spanning tree with union-find
04Dynamic Programming
4 टॉपिक+
- 0/1 knapsack
- Longest common subsequence
- Matrix chain multiplication
- Floyd-Warshall all-pairs shortest paths
05Backtracking
3 टॉपिक+
- N-queens problem
- Sum of subsets
- Graph colouring
06Graph Algorithms
4 टॉपिक+
- BFS and DFS
- Dijkstra's shortest path
- Bellman-Ford algorithm
- Topological sort
About this course
आप यह कर पाएँगे
- Implement sorting algorithms and compare their running time for different input sizes
- Implement divide-and-conquer algorithms such as binary search, merge sort and quick sort
- Implement greedy algorithms: fractional knapsack, Prim's, Kruskal's and Dijkstra's
- Implement dynamic programming solutions: 0/1 knapsack, LCS and Floyd-Warshall
- Solve n-queens and sum of subsets by backtracking
- Plot and interpret time complexity graphs
यह किसके लिए है
- B.Tech Computer Science & Engineering students of Semester 5 (AKTU)
- Students of other universities studying the same subject who want unit-wise coaching
आपको क्या चाहिए
- Design and Analysis of Algorithm theory of the same semester
- C / C++ / Java programming
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
सवाल
Which syllabus does the Design and Analysis of Algorithm Lab course follow?
It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Design and Analysis of Algorithm Lab. 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.
Which language should I use?
C or C++ is used by default; Java or Python can be used if your college allows it.
