Punjab Technical University | 5th

design and analysis of algorithms

design and analysis of algorithms previous year question papers on BRpaper are organized for students of Punjab Technical University’s Bachelor of Technology program in the Computer Science Engineering stream, 5th semester. This section makes it easier to browse subject-wise old question papers for design and analysis of algorithms, so students can review how questions are typically framed in past exams and get a sense of the exam pattern. Many students search for design and analysis of algorithms question paper with answers while preparing for exams, and this page is built to support exactly that kind of subject-wise browsing and revision. BRpaper is not the official website of Punjab Technical University or any institution, and it does not publish official notices or academic updates.
📚 Syllabus - DAA (B-TECH Computer Science Engineering 5th)

Introduction. What is an algorithm ? Time and space complexity of an algorithm. Comparing the

performance of different algorithms for the same problem. Different orders of growth. Asymptotic notation.

Polynomial vs. Exponential running time.

Basic Algorithm Design Techniques. Divide-and-conquer, greedy, randomization, and dynamic

programming. Example problems and algorithms illustrating the use of these techniques.

Graph Algorithms. Graph traversal: breadth-first search (BFS) and depth-first search (DFS). Applications

of BFS and DFS. Topological sort. Shortest paths in graphs: Dijkstra and Bellman-Ford. Minimum spanning

trees.

Sorting and searching. Binary search in an ordered array. Sorting algorithms such as Merge sort, Quick

sort, Heap sort, Radix Sort, and Bubble sort with analysis of their running times. Lower bound on sorting.

Median and order statistics.

NP-completeness. Definition of class NP. NP-hard and NP-complete problems. 3SAT is NP-complete.

Proving a problem to be NP-complete using polynomial-time reductions. Examples of NP-complete

problems.

Coping with NP-completeness. Approximation algorithms for various NP-complete problems.

Advanced topics. Pattern matching algorithms : Knuth-Morris-Pratt algorithm. Algorithms in Computational

Geometry : Convex hulls. Fast Fourier Transform (FFT) and its applications. Integer and polynomial

arithmetic. Matrix multiplication : Strassen's algorithm

Can't find the paper you need?

We don't have a recent paper for daa yet. Upload it and earn credits — it'll be reviewed before publishing.

Login to Upload
Question papers
2022
Download
2020
Download
Download
2019
Download
Download
2018
Download
Download
2017
Download
Download
2016
Download
Download
Download
2015
Download
Download
Download
2014
Download
Download
Download
Download
2013
Download
2012
Download
Download
2011
Download
2010
Download
2009
Download
Download
2008
Download
Download
2007
Download
Download
Download
2006
Download
Download

About This Question Paper Collection

Browse DAA 5th question papers for B-TECH Computer Science Engineering students at Punjab Technical University. This page helps students review question patterns, prepare for exams, and understand how previous papers are structured.

Select a paper below to open year-wise question papers, solutions, or available answer content where listed on BRpaper.

How Students Can Use These Papers

Old question papers for design and analysis of algorithms are a quick way to see how Punjab Technical University has structured exams in the past — useful for timing practice and identifying high-priority topics.

Treat them as a supplement, not a replacement, for the latest syllabus and official notices, and use them to build confidence before the actual exam.

FAQ

Frequently Asked Questions

Helpful answers about this subject, papers, and exam preparation.

Updated regularly
01 Where can I find design and analysis of algorithms previous year question papers for Bachelor of Technology Computer Science Engineering, 5th semester?

This page lists design and analysis of algorithms question papers uploaded for Punjab Technical University Bachelor of Technology Computer Science Engineering, 5th semester, organized for subject-wise browsing where available.

02 Are these official Punjab Technical University question papers?

BRpaper is not the official website of Punjab Technical University. These papers are shared for reference and revision purposes only and are not official university material.

03 How can previous year design and analysis of algorithms papers help in exam preparation?

Reviewing past papers can help you understand how questions are typically framed, notice commonly repeated topics, and get a sense of the exam pattern before your own exam.

04 What kind of topics does design and analysis of algorithms usually cover?

The question papers here relate to the official design and analysis of algorithms syllabus set by the university for this course and semester.

05 Does this page include a design and analysis of algorithms question paper with answers or solved answers?

This page focuses on providing access to the previous year question papers themselves. A separate question bank or solved answers may not be available for every paper.

06 Can I find papers for other subjects in the same Bachelor of Technology Computer Science Engineering?

Yes, BRpaper organizes papers by university, course, stream, and semester, so you can browse other subjects within the same Punjab Technical University Bachelor of Technology Computer Science Engineering.

Important

Important Disclaimer

BRpaper is not the official website of Punjab Technical University or any institution. BRpaper organizes available question papers for student reference only. For official notices, date sheets, results, syllabus changes, and academic updates, students should visit the official university website.