Scribd
Upload
16 views4 pages

Modulewise Questions On All Module

The document outlines various algorithms and concepts in computer science, including Big O, Omega, and Theta Notation, as well as sorting algorithms like insertion sort, merge sort, and quick sort. It also covers search algorithms such as binary search and discusses methods for solving recurrences and finding minimum spanning trees using Dijkstra's and Prim's algorithms. Additionally, it compares the time complexities of these algorithms and provides step-by-step instructions for sorting and finding paths in graphs.

Uploaded by

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

Modulewise Questions On All Module

The document outlines various algorithms and concepts in computer science, including Big O, Omega, and Theta Notation, as well as sorting algorithms like insertion sort, merge sort, and quick sort. It also covers search algorithms such as binary search and discusses methods for solving recurrences and finding minimum spanning trees using Dijkstra's and Prim's algorithms. Additionally, it compares the time complexities of these algorithms and provides step-by-step instructions for sorting and finding paths in graphs.

Uploaded by

ritikadarade1512
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Module-wise Question

Module No-1
Explain Big O, Omega and Theta Notation with example.OR Explain Asymptotic Notations OR What is
Asymptotic analysis and define big Oh,big Omega and Theta Notation ? OR Explain these notation with
apropriate equations and graphs.
Write algorithm for insertion sort and sort the fllowing elements using the same: 22,15,11,16,19 Show all
the passes. Or Also sort the following numbers using same algorithm 11,7,17,3,9,29,85,9 and show output
after every pass.
Explain Best Case, Average Case and Worst Case
Solve the followng Recurrence using Substitution Method.

Eplain Reccurrences and Various Method to solve recurrences

Module NO-2
Write a program on merge sort and analysis its time complexity.
Explain Binary search with e2xample & analysis its time complexity
What is greedy algorithm ?
Explain Binary search algorithm.OR write agorith and derive the complexity of binary search algoritm
Explain Quick Sort with algorithm and Example OR Write quick sort . Drive its time complexity
Apply Merge Sort algorithmbto sort the following numbers. Show each step clearly , 10,5,7,6,1,4,8,3,2,9
OR Derive its tme complexity using the substittion method. Sort the following elements with using Merge
What is the dfference between divideand conquer approch and dynamic progamming?
Sort the following number using Quick Sort. Also, derive the time complexity of Quick sort: 50,31,71,38,
77, 8l, l2, 33.

Module No-3
Explain Dijkstra Algorithm & Fractional Knapsack problem, Compare its time complexity
Write Algorithm for Krushal &Primes Compare its time complexity. OR Write Krushkal's algorithm for
finding
Write ana abstrack
minimunalgorithrn
spanning for
treegreedy
. Explain its working
design method.with an example .Also compute the time complexity
Find the Dijkstra’s shortest path from vertex 1 to vertex 4 for the following graph.
Find MST of the following graph using prims and kruskal's Algorthm

Find the shortest path from source vertex S using Dijkstra's Algorithm.

Find the single source shortest pathfor the following graph using Gredy Method. Take vertex A as the
source vertex.

Give step by step method to find te Minimum Spanning Tree of the given graph using Prim's Algorithm .
Take vertex 1 as the root.

You might also like