Scribd
Upload
90 views2 pages

Daa 2024

The document outlines the examination paper for a course on Algorithm Design and Analysis at a university, detailing the structure and types of questions included. It covers various algorithms such as Quicksort, Mergesort, and Dijkstra's algorithm, along with their complexities and applications. Additionally, it includes problems related to data structures, spanning trees, and NP-completeness.

Uploaded by

amitxpertdesk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
90 views2 pages

Daa 2024

The document outlines the examination paper for a course on Algorithm Design and Analysis at a university, detailing the structure and types of questions included. It covers various algorithms such as Quicksort, Mergesort, and Dijkstra's algorithm, along with their complexities and applications. Additionally, it includes problems related to data structures, spanning trees, and NP-completeness.

Uploaded by

amitxpertdesk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Universi har Engineering University, Path, Sek 4m Semester Examination, 2024 Tech anil Analysis of Algorithm Time: 04 Hours cour “Subjects Desian om Fall Marker 7 eS ov ete right-hand mars’ ction in (his Pape anall. No. Lis compuls the following (arty Seven question only): ‘the follo inl): ini calgon sidered here sort the inut sequences in ascending és Asus ascening order, sich Of the following is TRUET ee 1. Quicksort runs in @{n2) time u Bubblesort rans in (0 fe TH Mergesort runs in. (0) i TV. Insertion sort nuns in, En) time . G) Land ILonly (ii) Land Ith only Htand IV only’ iv) Land LV only a) (>) Worst-case complicity of heap sor ) Oclog m) (ii) O(n) Gil) O(n log 9) (iv) OG) (e) The worst case running times of Insertion sort. Merge sort and Quick sort respectively. are ©) 04 log n), (a fog n) and O(n") Lil) O(n"), O(n") and @n Log n) Git) @¢H*), @(n log n) and O(n log n)_ (iv) O07), O(n Tog n) and O(n?) {@)_ The minimum number of comparisons required to determine if an integer appears more than n/2 ‘times in sorted array of n integers is (i) O(n) Gi) O(log n) (ii) Of log n) (iy 00) (e) What is the minimum’ number of stacks of size n required to implement a queue of size n (ijone (io Githree {iv) four (1) Dijkstra’€algorithm is used to solve problems? (i) Singte source shortest path Gi All pair shortest path (ax Soning (iy) Searching (@)_ The approach followed in Floyd Warshall’s algorithm is (i) Greedy approach (id) Dynamic approach (iit) Backtracking (iv) Divide and conquer ~ ¢h) Hamiltonian path problem is__? NP Problem (ii) NP Complete (iil) P Class Problem (iv) N Class Problem (Which of the following algorithms are used to find the shortest path from a source node to all (iv) Kruskal’s Algorithm G)_ Kruskal’s Algorithm for finding the Minimum Spanning Tree ofa graph is a kind of a? (DP Problem (ii) Greedy Algorithm, (ili) Adhoc Problem {iv) None of the above Pape of? . Qe ae iptotie Notation. Show thar nt + Mog n= O(n") ® Sie relation T(n)= 27(n/2) + O(n) @3 (a) een gegen em ant posiregtiesieontin ob) Se Quick sort algorithm forthe following example 2,4,5,16,58,54,24,16,9,65,78 ee a Retin 1014 1927442631 (>) Explain Strassen’s matrix multiplication and its time complexity. QS (a) State Huffman Tree, Explain with examples. . i () Whatare NP-hard and NP-complete problems? += 7 @6 (a) Hegre Gveats protien can besos une ask aca si exer an , ®) Diet Heresy oetaocane dynam preweaning nev QZ _(a)_ Construct minimum cost spanning tree using Kruskal's algorithm ¥ 9:0 0 / a \ o 9 -@ @.-0.0 (©) Define spanning tree and minimum spanningtree @8 (a) Apply single source shortest path algorithm for the following graph Knapsack Problem, ‘on any two of the following - 7x2=14) 71 im 7 m 7 71 wv rm

You might also like