(SEM V) THEORY EXAMINATION 2017-18 DESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS (NCS-501)
B.Tech | Semester V | Section-wise Important Questions & Notes
SECTION A – Very Short Answer (2 × 10 = 20 Marks)
This section focuses on definitions, comparisons, and basic complexity analysis.
Answers should be short, direct, and to the point.
Important Questions
Difference between Binary Tree and Complete Binary Tree
Difference between Greedy Technique and Dynamic Programming
Solve recurrence using Master Method
Most practically used sorting algorithm and its time complexity
Find time complexity of given recurrence relations
Explain Single Source Shortest Path
Define Graph Coloring
Compare Time Complexity and Space Complexity
Characteristics of a good algorithm
Difference between Backtracking and Branch & Bound
Key Notes
Greedy → locally optimal choice; DP → optimal substructure + overlapping subproblems
Master Method is very important (practice all cases)
Practical sorting: Quick Sort / Merge Sort
Single source shortest path → finds shortest paths from one vertex to all others
Backtracking explores all possibilities; Branch & Bound prunes search space
SECTION B – Medium Answer (Attempt Any 3, 10 × 3 = 30 Marks)
This section is very important and often includes step-wise explanations and examples.
Important Questions
Solve recurrence using Recursion Tree Method
B-Tree insertion (degree t = 3) with given keys
Explain Minimum Cost Spanning Tree (MST) and Kruskal’s Algorithm with time complexity
Explain Red-Black Tree and insertion algorithm
Explain Heap Sort and illustrate it on a given array
Key Notes
Recursion tree → expand recurrence step by step
B-Tree questions are diagram-based and scoring
Kruskal’s Algorithm uses greedy approach + union-find
Red-Black Tree maintains balance using coloring rules
Heap Sort → build heap + repeated deletion (O(n log n))
SECTION C – Shortest Path / Geometry (10 Marks)
Important Questions
Explain Convex Hull Problem
Find shortest path using Dijkstra’s Algorithm from a given source
Key Notes
Convex hull → smallest polygon enclosing all points
Dijkstra → single source shortest path (no negative edges)
Write step-wise table for Dijkstra (very important for marks)
Related Notes
BASIC ELECTRICAL ENGINEERING
ENGINEERING PHYSICS THEORY EXAMINATION 2024-25
(SEM I) ENGINEERING CHEMISTRY THEORY EXAMINATION...
THEORY EXAMINATION 2024-25 ENGINEERING MATHEMATICS...
(SEM I) THEORY EXAMINATION 2024-25 ENGINEERING CHE...
(SEM I) THEORY EXAMINATION 2024-25 ENVIRONMENT AND...
Need more notes?
Return to the notes store to keep exploring curated study material.
Back to Notes StoreLatest Blog Posts
Best Home Tutors for Class 12 Science in Dwarka, Delhi
Top Universities in Chennai for Postgraduate Courses with Complete Guide
Best Home Tuition for Competitive Exams in Dwarka, Delhi
Best Online Tutors for Maths in Noida 2026
Best Coaching Centers for UPSC in Rajender Place, Delhi 2026
How to Apply for NEET in Gurugram, Haryana for 2026
Admission Process for BTech at NIT Warangal 2026
Best Home Tutors for JEE in Maharashtra 2026
Meet Our Exceptional Teachers
Discover passionate educators who inspire, motivate, and transform learning experiences with their expertise and dedication
Explore Tutors In Your Location
Discover expert tutors in popular areas across India
Discover Elite Educational Institutes
Connect with top-tier educational institutions offering world-class learning experiences, expert faculty, and innovative teaching methodologies