# CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION

Save this PDF as:

Size: px
Start display at page:

Download "CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION"

## Transcription

1 CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the requirements of an algorithm? 5. Why to study an algorithm? 6. Define Algorithm Validation.(Nov/Dec-2012) 7. What is Euclid s algorithm? Give example. 8. What are the two main issues related to algorithms? 9. What are the important problem types? 10. Define Program. 11. Write the For LOOP general format. 12. What do you mean by linear search?(nov/dec-2011) 13. What is recursive algorithm? 14. Define Recurrence equation.(apr/may-2010) 15. What is space complexity?(nov/dec-2012) 16. What is time complexity? 17. What is basic operation? 18. Differentiate time complexity from space complexity.(apr/may-2010) 19. Give an example input size and basic operations. 20. Give the two major phases of performance evaluation 21. Define input size. 22. Define best-case step count. 23. Define worst-case step count. 24. Define average step count. 25. Define the asymptotic notation Big oh (O) 26. Define the asymptotic notation Omega ( Ω ). 27. Define the asymptotic t\notation theta ( Ѳ) 28. Establish the relationship between O and Ω.(Nov/Dec-2010) 29. Define little oh. 30. What is the properties of big-oh Notation.(Nov/Dec-2011). 31. Give some properties of asymptotic order of growth. 32. What is Order of Growth? Write Order of Growth Sequence. 33. What are exponential growth functions? 34. What is worst-case efficiency? 35. What is best-case efficiency? 36. What is average case efficiency? 37. Write basic asymptotic efficiency classes. 38. Write algorithm using iterative function to fine sum of n numbers. 39. Write an algorithm using Recursive function to fine sum of n numbers, 40. Write an Algorithm for Sequential Search. 41. What are the types of recurrence equations? 42. What are the algorithm design techniques? 43. Write steps for time efficiency of non recursive algorithms. 44. What are the plans for Analysis of Recursive Algorithms? 1. Describe the steps in analyzing & coding an algorithm. 2. Define the asymptotic notations used for best case average case and worst case analysis of Algorithms. 3. Discuss the fundamentals of analysis framework. (Or) Explain the general framework for analyzing the efficiency of algorithm. (Or) Explain the various criteria used for analyzing algorithms. 4. Define Asymptotic Notations. Distinguish between Asymptotic notation and conditional Asymptotic notation.(nov/dec-2011) 5. Explain how the removing condition is done from the conditional Asymptotic notation with example.(nov/dec-2011)

2 6. Describe briefly the notations of complexity of an algorithm. 7. Explain some of the problem types used in the design of algorithm 8. List the properties of various asymptotic notations.(or) Explain the various asymptotic notations used in algorithm design.(nov/dec- 2012)(Apr/May-2010) 9. Briefly explain how to solve recurrence equations with an example.(or) What are the various methods of solving recurrences? Explain them in Brief.(Nov/Dec-2011) 10. Describe about the analysis of linear search with an example, if any.(nov/dec-2011)(nov/dec-2012) 11. Derive the recurrence equation for Fibonacci series. Perform complexity analysis for the same. 12. Define Input Size. Write an algorithm for matrix addition and construct step table for it. 13. Explain with examples Big Oh, Omega, Theta and Little Oh asymptotic notations 14. Explain the basic efficiency classes. 15. Explain briefly the concept of algorithmic strategies. 16. What is Pseudo-code? Explain with an example. 17. Find the complexity C(n) of the algorithm for the worst case, best case and average case.(evaluate average case complexity for n=3,where n is the number of inputs. 18. Write an algorithm for a given numbers n to generate the nth number of the Fibonacci sequence. 19. Explain the necessary steps for analyzing efficiency of recursive algorithms with an example. 20. Show a tree structure for recursive calls made in the problem of Tower of Hanoi. 21. Design a non-recursive algorithm for computing the product of two n*n matrices and also find the time efficiency of algorithm. 22. Write the recursive and non-recursive versions of the factorial function. Examine how much time each function requires as n become large.(apr/may-2011) UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 1. What is an optimal Solution?(Apr/May-2010) 2. What is Brute force technique? 3. Write Brute force for selection sort algorithm. 4. Write Brute force for string matching algorithm. 5. Brute-Force Polynomial Evaluation 6. Write Brute force for closest pair problem. 7. What are the strengths of Brute force? 8. What are the weaknesses of Brute force? 9. What is Exhaustive search? 10. Give an example of Exhaustive search? 11. What is Traveling Salesman problem?(nov/dec-2011) 12. What is Knapsack problem?(nov/dec-2011) 13. What is Assignment problem? 14. What are the disadvantages of Exhaustive search algorithm? 15. What is Divide and Conquer techniques? 16. Give an Example of Divide and Conquer. 17. Write Master Theorem Formula. 18. What is merge sort? 19. Write analysis of Merge sort. 20. What is Quick sort? 21. Write analysis of Quick sort. 22. What is binary search?

3 23. Write an algorithm for binary search. 24. Write analysis of Binary Search. 25. What are the limitations of Binary Search? 26. Trace the operation of the binary search algorithm for the input -15,- 6,,0,7,9,23,54,82,101,112,125,131,142,151 if you are searching for the element 9.(Nov/Dec-2012) 27. What is Multiplication of Large Integers Problem? 28. Give an Example for Multiplication of Large Integers Problem. 29. Give Brute force for conventional matrix multiplications. 30. Give Strassen s matrix multiplications. 31. Give an Analysis of Strassen s Algorithm. 32. What is Closest-Pair Problem by Divide-and-Conquer? 33. What is the Efficiency of the Closest-Pair Algorithm? 34. What is convex hull problem? 35. Give Quick hull Algorithm. 36. Write an efficiency of Quick hull Algorithm. 1. Write any four examples for Brute Force Approach. 2. Find the number of comparisons made by the sequential search in the worst & best case. 3. Give the time efficiency & Drawback of merge sort Algorithm. 4. What is the difference between DFS & BFS? 5. What is the Brute Force Algorithmic Strategy? 6. State the time complexity of following: (i) Bubble sort (ii) Selection sort (iii) Sequential search (iv) Brute force string matching 7. What are the features of Brute force String matching algorithm? 8. With Suitable algorithm,explain the problem of finding the maximum and minimum items in a set of n elements.(apr/may-2010) 9. Explain about Traveling Salesman Problem using Brute Force Techniques with an example. 10. Explain about Knapsack Problem using Brute Force Techniques with an example. 11. Explain about Assignment problem using Brute Force Techniques with an example. 12. Give any two strength & Weakness of Brute force algorithm. 13. Explain Brute force string matching algorithm. 14. Define Divide & Conquer Technique. 15. State Master s Theorem. 16. What is divide and Conquer strategy and explain the binary search with suitable example problem.(nov/dec-2011) 17. Define Merge sort & explain three steps of Merge sort. 18. Define Quick sort & explain three steps of Quick sort. 19. Define Binary Search. Explain the binary search algorithm with an example. And explain its best, average and worst case time complexities.(nov/dec-2012) 20. What are the applications of binary search? 21. State advantages & Disadvantages of binary search. 22. Explain Binary search tree. 23. Describe binary search tree with three traversal patterns? Give suitable example with neat diagram for all three traversal of binary search.(nov/dec-2011) 24. Discuss the algorithm for finding minimum cost binary search tree. Explain with suitable example.(nov/dec-2012) 25. What is the recurrence relation for divide & conquer? 26. Explain Merge Sort problem using divide and conquer technique. Give an example.(apr/may-2010)

4 27. Distinguish between quick sort and mergesort,and arrange the following in increasing order using merge sort(18,29,68,32,43,37,87,24,47,50)(nov/dec-2011) 28. Trace the steps of Mergesort algorithm for the elements 122,25,70,175,80,90,95,102,123 and also compute its time complexity.(nov/dec-2012) 29. Explain Multiplication of Large Integers using Divide and Conquer technique. 30. Explain Strassen s Matrix Multiplication using Divide and Conquer technique 31. Explain Closest-Pair and Convex-Hull Problems using Divide and Conquer technique. UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 1. What is dynamic programming? 2. Compare divide & conquer and Dynamic programming. 3. How the problems can be solved using dynamic programming? 4. What is binomial-coefficient? Give an example. 5. Define Wars hall s algorithm. 6. Define Floyd s algorithm. 7. Give any two properties of dynamic programming approach. 8. Define principle of optimality.(nov/dec-2010) 9. What is OBST?(Apr/May-2010) 10. What is Greedy method? 11. State the general principle of Greedy algorithm.(nov/dec-2010) 12. Compare Divide and conquer with dynamic Programming.(Nov/Dec 2010) 13. Compare Greedy algorithm & Dynamic programming.(nov/dec- 2010)(Apr/May-2011) 14. Write an algorithm to find the shortest path between All pairs of nodes.(apr/may-2011) 15. What is graph cloning.(nov/dec-2011) 16. What is graph coloring strategy.(nov/dec-2012) 17. What is spanning tree? Give an example.(nov/dec-2011) 18. Define Multi stage graph.(apr/may-2010) 19. Define Prim s algorithm. 20. Define Kruskal s algorithm. 21. Define Dijikstra s shortest path algorithm. 22. How to obtain Huffman s Code? 23. What are the applications of Huffman trees? 24. What are the applications of spanning trees? 1. Explain Dynamic Programming techniques with suitable ecample. 2. How to compute Binomial-Coefficient Using Dynamic Programming technique? 3. What is Warshall s algorithm? Explain with an example. 4. Explain in detail about the multi-stage graphs with suitable example. 5. Explain in detail about the All-Pair shortest path problem with suitable example. (Apr/May-2010)(Nov/Dec-2010) 6. What is Floyd s algorithm? Explain with an example. (Nov/Dec 2009,2011) 7. Explain in detail about the optimal binary search trees with an example.(apr/may 2011) 8. Discuss the use of Greedy algorithm in solving knapsack problem. 9. Describe about the traveling salesman problem and discuss how to solve it using dynamic programming.(apr/may-2010)(nov/dec-2012)

6 UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 1. What is trivial lower bound? 2. What is a Decision tree? 3. What is information-theoretic lower bound? 4. Define Class P. 5. Define Class NP. 6. Define Class NP Complete.(Nov/Dec-2010) 7. What is tractable and intractable problem? 8. What is halting problem? 9. Define Backtracking. 10. Explain the idea behind backtracking.(nov/dec-2010) 11. What are the applications of backtracking? 12. What are the algorithm design techniques? 13. Define n-queens problem. 14. Define Hamiltonian Circuit problem. 15. Define sum of subset problem. 16. What is state space tree? 17. Define Branch & Bound meth 18. Define assignment problem. 19. What is promising & non-promising node? 20. Define Knapsack s problem. 21. Define Travelling salesman problem. 22. State principle of backtracking. 23. Compare Backtracking & Branch and Bound techniques with an example. 24. What are the applications of branch & bound? 25. What are the examples of branch & bound? 26. In Backtracking method, how the problem can be categorized? 27. How should be determine the solution in backtracking algorithm? 28. What is a FIFO branch and Bound Algorithm.(Apr/May-2010) 29. Obtain all possible solutions to 4-Queen s problem. 30. Generate at least 3-solutions for 5-Queen s problem. 31. Draw a pruned state space tree for a given sum of subset problem s={3,4,5,6} and d= What is Approximation Algorithm? 33. What is NP-hard Problem?(Nov/Dec-2010) 34. Define NP-Completeness.(Nov/Dec-2011) 35. What is the property of NP-Complete problem?(nov/dec-2012) 32. Explain about Limitations of Algorithm Power-Lower-Bound Arguments. 33. Explain Decision Trees concepts. 34. Explain Class P, NP and NP Complete problem with an example. 35. Write Short notes on NP hard and NP-Completeness.(Apr/May-2012) 36. Explain Backtracking with suitable example. 37. State and Solve n-queen Problem using Backtracking technique.(apr/may-2010)(apr/may-2011) 38. How does backtracking work on the 8 Queens problem with suitable example?(nov/dec-2011)(nov/dec-2012) 39. Explain elaborately recursive backtracking algorithm?(nov/dec-2011) 40. What is state Space tree? Explain with one example. 41. What is Hamiltonian problem? Explain with an example using backtracking. (Nov/Dec-2011). 42. Explain Subset-Sum problem with suitable example. 43. Explain Branch and bound design technique with suitable example. 44. Compare the contrast LC-BB and FIFO BB.(Nov/Dec-2012) 45. Explain Assignment problem with an example.

7 46. Explain Knapsack Problem using branch and bound with an example.(nov/dec-2010)(apr/may-2010)(nov/dec-2012) 47. Explain Traveling Salesman Problem with an example using branch and bound technique. 48. What is Approximation Algorithm? Write Short notes on it. 49. Explain NP-hard Problem with suitable example. 50. Explain Travelling salesman problem using Approximation Algorithm. 51. Explain Knapsack problem using Approximation Algorithm.

### Anany Levitin 3RD EDITION. Arup Kumar Bhattacharjee. mmmmm Analysis of Algorithms. Soumen Mukherjee. Introduction to TllG DCSISFI &

Introduction to TllG DCSISFI & mmmmm Analysis of Algorithms 3RD EDITION Anany Levitin Villa nova University International Edition contributions by Soumen Mukherjee RCC Institute of Information Technology

### CSCE 321/3201 Analysis and Design of Algorithms. Prof. Amr Goneid. Fall 2016

CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Fall 2016 CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Course Resources Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu

### Introduction to Algorithms Third Edition

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction

### Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

### Introduction to Algorithms

Thomas H. Carmen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Contents Preface xiii - I Foundations

### 4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...

Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...

### IV/IV B.Tech (Regular) DEGREE EXAMINATION. Design and Analysis of Algorithms (CS/IT 414) Scheme of Evaluation

IV/IV B.Tech (Regular) DEGREE EXAMINATION Design and Analysis of Algorithms (CS/IT 414) Scheme of Evaluation Maximum: 60 Marks 1. Write briefly about the following 1*12= 12 Marks a) Give the characteristics

### UNIT 1 BASICS OF AN ALGORITHM

UNIT 1 BASICS OF AN ALGORITHM Basics of an Algorithm Structure Page Nos. 1.0 Introduction 5 1.1 Objectives 6 1.2. Analysis and Complexity of Algorithms 6 1.3 Basic Technique for Design of Efficient Algorithms

### CS 440 Theory of Algorithms /

CS 440 Theory of Algorithms / CS 468 Algorithms in Bioinformaticsi Brute Force. Design and Analysis of Algorithms - Chapter 3 3-0 Brute Force A straightforward approach usually based on problem statement

### CS6402 Design and Analysis of Algorithm. 2 Marks Question & Answer UNIT I INTRODUCTION

CS6402 Design and Analysis of Algorithm 2 Marks Question & Answer UNIT I INTRODUCTION 1. What is performance measurement? Performance measurement is concerned with obtaining the space and the time requirements

### UCS-406 (Data Structure) Lab Assignment-1 (2 weeks)

UCS-40 (Data Structure) Lab Assignment- (2 weeks) Implement the following programs in C/C++/Python/Java using functions a) Insertion Sort b) Bubble Sort c) Selection Sort d) Linear Search e) Binary Search

### Algorithms and Data Structures

Algorithm Analysis Page 1 - Algorithm Analysis Dr. Fall 2008 Algorithm Analysis Page 2 Outline Textbook Overview Analysis of Algorithm Pseudo-Code and Primitive Operations Growth Rate and Big-Oh Notation

### Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:

### n 2 ( ) ( ) Ο f ( n) ( ) Ω B. n logn Ο

CSE 220 Name Test Fall 20 Last 4 Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. 4 points each. The time to compute the sum of the n elements of an integer array is in:

### CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces

### n 2 ( ) ( ) + n is in Θ n logn

CSE Test Spring Name Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply an m n matrix and a n p matrix is in: A. Θ( n) B. Θ( max(

### Department of Computer Science and Technology

UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the

### ( ) D. Θ ( ) ( ) Ο f ( n) ( ) Ω. C. T n C. Θ. B. n logn Ο

CSE 0 Name Test Fall 0 Multiple Choice. Write your answer to the LEFT of each problem. points each. The expected time for insertion sort for n keys is in which set? (All n! input permutations are equally

### CIS 121 Data Structures and Algorithms with Java Spring Code Snippets and Recurrences Monday, January 29/Tuesday, January 30

CIS 11 Data Structures and Algorithms with Java Spring 018 Code Snippets and Recurrences Monday, January 9/Tuesday, January 30 Learning Goals Practice solving recurrences and proving asymptotic bounds

### Divide-and-Conquer. Dr. Yingwu Zhu

Divide-and-Conquer Dr. Yingwu Zhu Divide-and-Conquer The most-well known algorithm design technique: 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances independently

### 1. Basic idea: Use smaller instances of the problem to find the solution of larger instances

Chapter 8. Dynamic Programming CmSc Intro to Algorithms. Basic idea: Use smaller instances of the problem to find the solution of larger instances Example : Fibonacci numbers F = F = F n = F n- + F n-

### CS261: Problem Set #2

CS261: Problem Set #2 Due by 11:59 PM on Tuesday, February 9, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:

### Data Structures and Algorithm Analysis in C++

INTERNATIONAL EDITION Data Structures and Algorithm Analysis in C++ FOURTH EDITION Mark A. Weiss Data Structures and Algorithm Analysis in C++, International Edition Table of Contents Cover Title Contents

### 3 INTEGER LINEAR PROGRAMMING

3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=

Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible

### Data Structures and Algorithms

Data Structures and Algorithms About the course (objectives, outline, recommended reading) Problem solving Notions of Algorithmics (growth of functions, efficiency, programming model, example analysis)

### Network optimization: An overview

Network optimization: An overview Mathias Johanson Alkit Communications 1 Introduction Various kinds of network optimization problems appear in many fields of work, including telecommunication systems,

### Algorithm. Lecture3: Algorithm Analysis. Empirical Analysis. Algorithm Performance

Algorithm (03F) Lecture3: Algorithm Analysis A step by step procedure to solve a problem Start from an initial state and input Proceed through a finite number of successive states Stop when reaching a

### NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.

CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT

### Database Concepts and Applications

,'.'. Page No... 1 MCA401 USN Fourth Semester M.C.ADegree Examination, July IAugust 2004 Master of Computer Applications (Old Scheme) Database Concepts and Applications Time: 3 hrs.] [Max.Marks : 100 Note:

### Dynamic Programming. Nothing to do with dynamic and nothing to do with programming.

Dynamic Programming Deliverables Dynamic Programming basics Binomial Coefficients Weighted Interval Scheduling Matrix Multiplication /1 Knapsack Longest Common Subsequence 6/12/212 6:56 PM copyright @

### Question Paper Code : 97044

Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)

### Algorithmic Analysis. Go go Big O(h)!

Algorithmic Analysis Go go Big O(h)! 1 Corresponding Book Sections Pearson: Chapter 6, Sections 1-3 Data Structures: 4.1-4.2.5 2 What is an Algorithm? Informally, any well defined computational procedure

### Algorithm classification

Types of Algorithms Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We ll talk about a classification scheme for algorithms This classification scheme

### Algorithm Efficiency & Sorting. Algorithm efficiency Big-O notation Searching algorithms Sorting algorithms

Algorithm Efficiency & Sorting Algorithm efficiency Big-O notation Searching algorithms Sorting algorithms Overview Writing programs to solve problem consists of a large number of decisions how to represent

### Lecture Summary CSC 263H. August 5, 2016

Lecture Summary CSC 263H August 5, 2016 This document is a very brief overview of what we did in each lecture, it is by no means a replacement for attending lecture or doing the readings. 1. Week 1 2.

### Algorithm Analysis. Gunnar Gotshalks. AlgAnalysis 1

Algorithm Analysis AlgAnalysis 1 How Fast is an Algorithm? 1 Measure the running time» Run the program for many data types > Use System.currentTimeMillis to record the time Worst Time Average Best» Usually

### INTRODUCTION. Analysis: Determination of time and space requirements of the algorithm

INTRODUCTION A. Preliminaries: Purpose: Learn the design and analysis of algorithms Definition of Algorithm: o A precise statement to solve a problem on a computer o A sequence of definite instructions

### Introduction to Data Structure

Introduction to Data Structure CONTENTS 1.1 Basic Terminology 1. Elementary data structure organization 2. Classification of data structure 1.2 Operations on data structures 1.3 Different Approaches to

### Algorithms CS2500. Dr. Simone Silvestri Compiled with the help of Ken Goss Version 1.2

Algorithms CS2500 Dr. Simone Silvestri Compiled with the help of Ken Goss Version 1.2 April 17, 2017 Contents 1 Introduction to Algorithms 4 1.1 Algorithms design & analysis, why do we care?.................

### Lecture 3, Review of Algorithms. What is Algorithm?

BINF 336, Introduction to Computational Biology Lecture 3, Review of Algorithms Young-Rae Cho Associate Professor Department of Computer Science Baylor University What is Algorithm? Definition A process

### Design and Analysis of Algorithms

CSE 101, Winter 018 D/Q Greed SP s DP LP, Flow B&B, Backtrack Metaheuristics P, NP Design and Analysis of Algorithms Lecture 8: Greed Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Optimization

### CMSC132, Practice Questions

CMSC132, Practice Questions Notice the final exam can include material not covered by the practice questions. You should practice beyond what is covered in this document. Although solutions will not be

### Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret

Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Greedy Algorithms (continued) The best known application where the greedy algorithm is optimal is surely

### Problem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.

CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.

### Data Structures and Algorithms. Part 2

1 Data Structures and Algorithms Part 2 Werner Nutt 2 Acknowledgments The course follows the book Introduction to Algorithms, by Cormen, Leiserson, Rivest and Stein, MIT Press [CLRST]. Many examples displayed

### Lecture Notes for IEOR 266: Graph Algorithms and Network Flows

Lecture Notes for IEOR 266: Graph Algorithms and Network Flows Professor Dorit S. Hochbaum Contents 1 Introduction 1 1.1 Assignment problem.................................... 1 1.2 Basic graph definitions...................................

### Adikavi Nannaya University, Rajahmundry MCA III Semester 3.1 Computer Networks (Model Question Paper) Time : 3 Hours Max.

3.1 Computer Networks (Model Question Paper) 1. a)with a neat block diagram explain the TCP/IP reference model. List out the limitations of the model. [15] (b) What are the functions of the physical layer?

### Decreasing a key FIB-HEAP-DECREASE-KEY(,, ) 3.. NIL. 2. error new key is greater than current key 6. CASCADING-CUT(, )

Decreasing a key FIB-HEAP-DECREASE-KEY(,, ) 1. if >. 2. error new key is greater than current key 3.. 4.. 5. if NIL and.

### 4 Dynamic Programming

4 Dynamic Programming Dynamic Programming is a form of recursion. In Computer Science, you have probably heard the tradeoff between Time and Space. There is a trade off between the space complexity and

### CS301 - Data Structures Glossary By

CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm

### IN101: Algorithmic techniques Vladimir-Alexandru Paun ENSTA ParisTech

IN101: Algorithmic techniques Vladimir-Alexandru Paun ENSTA ParisTech License CC BY-NC-SA 2.0 http://creativecommons.org/licenses/by-nc-sa/2.0/fr/ Outline Previously on IN101 Python s anatomy Functions,

### UNIT 5 GRAPH. Application of Graph Structure in real world:- Graph Terminologies:

UNIT 5 CSE 103 - Unit V- Graph GRAPH Graph is another important non-linear data structure. In tree Structure, there is a hierarchical relationship between, parent and children that is one-to-many relationship.

### CSE373: Data Structures and Algorithms Lecture 4: Asymptotic Analysis. Aaron Bauer Winter 2014

CSE373: Data Structures and Algorithms Lecture 4: Asymptotic Analysis Aaron Bauer Winter 2014 Previously, on CSE 373 We want to analyze algorithms for efficiency (in time and space) And do so generally

### Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far:

Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far: I Strength of formulations; improving formulations by adding valid inequalities I Relaxations and dual problems; obtaining

### ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

ASSIGNMENTS Chapter Q. No. Questions Course Outcom e (CO) Progra m Outcom e I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) 2 3. What is the time complexity of the algorithm? 4

### J Linear Programming Algorithms

Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.]

### Chapter 2: Complexity Analysis

Chapter 2: Complexity Analysis Objectives Looking ahead in this chapter, we ll consider: Computational and Asymptotic Complexity Big-O Notation Properties of the Big-O Notation Ω and Θ Notations Possible

### Lecture 2: Algorithm Analysis

ECE4050/CSC5050 Algorithms and Data Structures Lecture 2: Algorithm Analysis 1 Mathematical Background Logarithms Summations Recursion Induction Proofs Recurrence Relations 2 2 Logarithm Definition: 3

### 10. EXTENDING TRACTABILITY

0. EXTENDING TRACTABILITY finding small vertex covers solving NP-hard problems on trees circular arc coverings vertex cover in bipartite graphs Lecture slides by Kevin Wayne Copyright 005 Pearson-Addison

### Shortest path problems

Next... Shortest path problems Single-source shortest paths in weighted graphs Shortest-Path Problems Properties of Shortest Paths, Relaxation Dijkstra s Algorithm Bellman-Ford Algorithm Shortest-Paths

### Recursion & Dynamic Programming. Algorithm Design & Software Engineering March 17, 2016 Stefan Feuerriegel

Recursion & Dynamic Programming Algorithm Design & Software Engineering March 17, 2016 Stefan Feuerriegel Today s Lecture Objectives 1 Specifying the complexity of algorithms with the big O notation 2

### Module 6 NP-Complete Problems and Heuristics

Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 97 E-mail: natarajan.meghanathan@jsums.edu Optimization vs. Decision

### CSCE 411 Design and Analysis of Algorithms

CSCE 411 Design and Analysis of Algorithms Set 3: Divide and Conquer Slides by Prof. Jennifer Welch Spring 2014 CSCE 411, Spring 2014: Set 3 1 General Idea of Divide & Conquer 1. Take your problem and

### Computer Science 210 Data Structures Siena College Fall Topic Notes: Complexity and Asymptotic Analysis

Computer Science 210 Data Structures Siena College Fall 2017 Topic Notes: Complexity and Asymptotic Analysis Consider the abstract data type, the Vector or ArrayList. This structure affords us the opportunity

### Classic Data Structures Introduction UNIT I

ALGORITHM SPECIFICATION An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. All algorithms must satisfy the following criteria: Input. An algorithm has zero

### UNIT 1 ANALYSIS OF ALGORITHMS

UNIT 1 ANALYSIS OF ALGORITHMS Analysis of Algorithms Structure Page Nos. 1.0 Introduction 7 1.1 Objectives 7 1.2 Mathematical Background 8 1.3 Process of Analysis 12 1.4 Calculation of Storage Complexity

### Encoding/Decoding, Counting graphs

Encoding/Decoding, Counting graphs Russell Impagliazzo and Miles Jones Thanks to Janine Tiefenbruck http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ May 13, 2016 11-avoiding binary strings Let s consider

### Dynamic programming. Trivial problems are solved first More complex solutions are composed from the simpler solutions already computed

Dynamic programming Solves a complex problem by breaking it down into subproblems Each subproblem is broken down recursively until a trivial problem is reached Computation itself is not recursive: problems

### Module 6 P, NP, NP-Complete Problems and Approximation Algorithms

Module 6 P, NP, NP-Complete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu

### 1 Summation Formulae, Induction and Bounding. 2 How to compare functions: o, ω, O, Ω, Θ. 3 How to count the running time of algorithms

What We ve Learned IE170: Algorithms in Systems Engineering: Lecture 10 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University February 5, 2007 1 Summation Formulae, Induction

### Design and Analysis of Algorithms 演算法設計與分析. Lecture 7 April 15, 2015 洪國寶

Design and Analysis of Algorithms 演算法設計與分析 Lecture 7 April 15, 2015 洪國寶 1 Course information (5/5) Grading (Tentative) Homework 25% (You may collaborate when solving the homework, however when writing

### Encoding/Decoding and Lower Bound for Sorting

Encoding/Decoding and Lower Bound for Sorting CSE21 Winter 2017, Day 19 (B00), Day 13 (A00) March 1, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Announcements HW #7 assigned Due: Tuesday 2/7 11:59pm

### CS171 Final Practice Exam

CS171 Final Practice Exam Name: You are to honor the Emory Honor Code. This is a closed-book and closed-notes exam. You have 150 minutes to complete this exam. Read each problem carefully, and review your

### Dynamic Programming Homework Problems

CS 1510 Dynamic Programming Homework Problems 1. (2 points) Consider the recurrence relation T (0) = T (1) = 2 and for n > 1 n 1 T (n) = T (i)t (i 1) i=1 We consider the problem of computing T (n) from

### VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR 603 203 FIRST SEMESTER B.E / B.Tech., (Common to all Branches) QUESTION BANK - GE 6151 COMPUTER PROGRAMMING UNIT I - INTRODUCTION Generation and

### MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: September 28, 2016 Edited by Ofir Geri

CS161, Lecture 2 MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: September 28, 2016 Edited by Ofir Geri 1 Introduction Today, we will introduce a fundamental algorithm design paradigm,

### Topics. Trees Vojislav Kecman. Which graphs are trees? Terminology. Terminology Trees as Models Some Tree Theorems Applications of Trees CMSC 302

Topics VCU, Department of Computer Science CMSC 302 Trees Vojislav Kecman Terminology Trees as Models Some Tree Theorems Applications of Trees Binary Search Tree Decision Tree Tree Traversal Spanning Trees

### Chapter 3: The Efficiency of Algorithms Invitation to Computer Science,

Chapter 3: The Efficiency of Algorithms Invitation to Computer Science, Objectives In this chapter, you will learn about Attributes of algorithms Measuring efficiency Analysis of algorithms When things

### MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: April 1, 2015

CS161, Lecture 2 MergeSort, Recurrences, Asymptotic Analysis Scribe: Michael P. Kim Date: April 1, 2015 1 Introduction Today, we will introduce a fundamental algorithm design paradigm, Divide-And-Conquer,

### 3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

### Assignment 1 (concept): Solutions

CS10b Data Structures and Algorithms Due: Thursday, January 0th Assignment 1 (concept): Solutions Note, throughout Exercises 1 to 4, n denotes the input size of a problem. 1. (10%) Rank the following functions

### Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 13 Divide and Conquer Closest Pair of Points Convex Hull Strassen Matrix Mult. Adam Smith 9/24/2008 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova,

### CS 170 DISCUSSION 8 DYNAMIC PROGRAMMING. Raymond Chan raychan3.github.io/cs170/fa17.html UC Berkeley Fall 17

CS 170 DISCUSSION 8 DYNAMIC PROGRAMMING Raymond Chan raychan3.github.io/cs170/fa17.html UC Berkeley Fall 17 DYNAMIC PROGRAMMING Recursive problems uses the subproblem(s) solve the current one. Dynamic

### Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem

Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem Uncapacitated Networks: Basic primal and dual solutions Flow conservation constraints

### CSE 5311: PROGRAMMING PROJECT TOPICS

CSE 5311: PROGRAMMING PROJECT TOPICS Several programming projects are briefly described below. However, in exceptional circumstances we are willing to consider other programming proposals that you may

### UNIVERSITY OF TORONTO Department of Computer Science April 2014 Final Exam CSC373H1S Robert Robere Duration - 3 hours No Aids Allowed.

UNIVERSITY OF TORONTO Department of Computer Science April 2014 Final Exam CSC373H1S Robert Robere Duration - 3 hours No Aids Allowed. PLEASE COMPLETE THE SECTION BELOW AND THE SECTION BEHIND THIS PAGE:

### The Running Time of Programs

The Running Time of Programs The 90 10 Rule Many programs exhibit the property that most of their running time is spent in a small fraction of the source code. There is an informal rule that states 90%

### Module 1: Asymptotic Time Complexity and Intro to Abstract Data Types

Module 1: Asymptotic Time Complexity and Intro to Abstract Data Types Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu

### Spanning Tree. Lecture19: Graph III. Minimum Spanning Tree (MSP)

Spanning Tree (015) Lecture1: Graph III ohyung Han S, POSTH bhhan@postech.ac.kr efinition and property Subgraph that contains all vertices of the original graph and is a tree Often, a graph has many different

### CSCE f(n) = Θ(g(n)), if f(n) = O(g(n)) and f(n) = Ω(g(n)).

CSCE 3110 Asymptotic Notations Let f and g be functions on real numbers. Then: f(n) = O(g(n)), if there are constants c and n 0 so that f(n) cg(n)), for n n 0. f(n) = Ω(g(n)), if there are constants c

### Lecture 6: Combinatorics Steven Skiena. skiena

Lecture 6: Combinatorics Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Learning to Count Combinatorics problems are

### DATA STRUCTURES AND ALGORITHMS. Asymptotic analysis of the algorithms

DATA STRUCTURES AND ALGORITHMS Asymptotic analysis of the algorithms Summary of the previous lecture Algorithm definition Representation of the algorithms: Flowchart, Pseudocode Description Types of the

Aperiodic Task Scheduling Radek Pelánek Preemptive Scheduling: The Problem 1 processor arbitrary arrival times of tasks preemption performance measure: maximum lateness no resources, no precedence constraints

### Dynamic Programming Homework Problems

CS 1510 Dynamic Programming Homework Problems 1. Consider the recurrence relation T(0) = T(1) = 2 and for n > 1 n 1 T(n) = T(i)T(i 1) i=1 We consider the problem of computing T(n) from n. (a) Show that

### 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

(DMCA 101) ASSIGNMENT - 1, DEC - 2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization