Scribd
Upload
5 views3 pages

MidTermQBank-AnalysisOfAlgorithm

The document provides a comprehensive overview of algorithms, including definitions, types, and analysis methods such as Big O, Big Omega, and Theta notations. It covers various sorting and searching algorithms, their time complexities, and recurrence relations, along with examples and performance evaluations. Additionally, it discusses fundamental data structures and abstract data types, along with questions and answers related to algorithm design and analysis.

Uploaded by

noreennazmrd123
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
5 views3 pages

MidTermQBank-AnalysisOfAlgorithm

The document provides a comprehensive overview of algorithms, including definitions, types, and analysis methods such as Big O, Big Omega, and Theta notations. It covers various sorting and searching algorithms, their time complexities, and recurrence relations, along with examples and performance evaluations. Additionally, it discusses fundamental data structures and abstract data types, along with questions and answers related to algorithm design and analysis.

Uploaded by

noreennazmrd123
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/ 3

What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis |

Asympto c Nota ons | Big O | Big Omega | Theta Nota ons |


Comparison of Various Time Complexi es | Different types in Increasing Order|
Time Complexi es of all Searching and Sor ng Algorithms
L-1.7: Ques on#1 on Comparison of Various Time Complexi es
L-1.8: Ques on#2 on Comparison of Various Time Complexi es |
L-2.1: What is Recurrence Rela on| How to Write Binary Search Recurrence Rela on|How we
Solve them
L-2.2: Recurrence Rela on [ T(n)= T(n/2) + c] | Subs tu on Method | Algorithm
L-2.3: Recurrence Rela on [ T(n)= n*T(n-1) ] | Subs tu on Method | Algorithm
L-2.4: Recurrence Rela on [ T(n)= 2T(n/2) +n] | Subs tu on Method | Algorithm
L-2.5: Recurrence Rela on [ T(n)= T(n-1) +logn] | Subs tu on Method | Algorithm
L-3.0: Divide and Conquer | Algorithm
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer
L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm
How Merge Sort Works?? Full explana on with example
L-3.3: Imp. Ques on on Merge Sort | Divide and Conquer | Algorithm
L-3.4: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example |
Algorithm
L-3.5: Inser on Sort | Time Complexity Analysis | Stable Sort | Inplace Sor ng
L-3.6: Selec on Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace
or Not
Define Algorithm. [MAY/JUNE 2013] APRIL/MAY 2017,NOV/DEC 2018
Compare Time Efficiency and Space Efficiency? [APRIL/MAY 2010 ]
What is Big ‘Oh’ Nota on? [MAY/JUNE 2013, MAY/JUNE 2012]
What is a recurrence equa on? [APRIL/MAY 2010]
What is the proper es of Asympto c nota on[NOV / DEC 2011,MAY/JUNE 2015 ]
What is meant by linear search? [NOV/DEC 2011, MAY/JUNE 2012 ]
What are the different types of me complexity?
What is recursive algorithm?
What is Sor ng Problem?
What is Searching Problem?
List the features of efficient algorithm?
Define Order of Algorithm
What is the subs tu on method?
Define the asympto c t\nota on “theta” (θ )
What is performance measurement?
List the desirable proper es of algorithm.NOV/DEC 2018
Give the two major phases of performance evalua on
Define input size.
Define best-case step count.
Define worst-case step count.
Define average step count.
Define best ,worst, average case me complexity.NOV/DEC2018
What is correctness of algorithm?
How can you Classify Algorithms?
What are fundamental data structures?
The most important elementary data structures are the array and the linked list. They are used
for represen ng more abstract data structures such as the list, the stack, the queue, the graph
(via its adjacency matrix or adjacency lists), the binary tree, and the set.
What is an Abstract Data type?
An abstract collec on of objects with several opera ons that can be performed on them is
called an abstract data type (ADT). The list, the stack, the queue, the priority queue, and the
dic onary are important examples of abstract data types. Modern object-oriented languages
support implementa on of ADTs by means of classes
List 5 of basic efficiency classes.
What is the formula used to calculate the algorithm's running me?
What is the order of growth?
Write general plan for analyzing non-recursive algorithms.
Write general plan for analyzing recursive algorithms.
Write the Asympto c nota ons used for worst-case,best-case and the average case analysis of
algorithms
Explain Basic Efficiency Classes.
What is Divide and Conquer Algorithm?[MAY/JUNE 2016] NOV/DEC 2017
What is Fibonacci Numbers?
Discuss binary search algorithm and Give compu ng me for Binary search? [ MAY/ JUNE
2015]
What is the Quick sort and Write the Analysis for the Quick sort?
Give the me efficiency and drawback of merge sort algorithm.
Define recursive call?
What is meant by Direct recursive call?
Define indirect recursive call?
What is a pivot?
What is the efficiency of selec on sort
What is the efficiency of bubble sort?
Explain Quick sort and arrange the following numbers in increasing order using QUICK sort.
(18, 29, 68, 32, 43,37, 87, 24, 47, 50), NOV/DEC 2017, APR/MAY 2018,NOV/DEC 2018

Ques ons from the following link:


h ps://www.ourcrea veinfo.in/daa-design-analysis-of-algorithms-2-marks-ques ons-with-
answers/

You might also like