Skip to main content

DAA (IT)

   

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) 
by 
PATHAN AHMED KHAN
 
Lecture Notes Unit Wise

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) Notes Unit Wise

Unit I

Introduction

 

Unit II

Divide- and Conquer

 

Greedy Method

 

Unit III

Dynamic Programming 

 

Backtracking

 

Branch and Bounds

 

Unit IV

Graph Algorithms & Graph Traversal Technique

Tries

Unit V

Computational Complexity

NP-Hard and NP-Completeness

 




IMPORTANT QUESTIONS FOR IT :    Click Here 

LAB PROGRAMS: Click Here


DAA (IT) SYLLABUS : Click Here



DAA LAB PROGRAMS FOR IT 

Course Objective Course Outcomes Student will able to
 Develop and implement various searching and sorting techniques and estimate the complexities of searching and sorting algorithms.
 Solve knapsack problem using greedy method and dynamic programming.
 Develop and implement shortest path algorithms using Travelling salesman problem and All pair shortest path problem.
 Apply backtracking technique to solve N-queen problem.
 Construct graph traversals using breath first search and depth first search.

List of Experiments:
1. Implement Recursive Binary search and determine the time taken to search an element
2. Implement Linear search and determine the time taken to search an element.
3. Sort a given set of elements using Merge sort method and determine the time taken to sort the elements.
4. Sort a given set of elements using Quick sort method and determine the time taken to sort the elements.
5. Implement Knapsack problem using greedy method.
6. Implement 0/1 Knapsack problem using dynamic programming.
7. Implement any scheme to find the optimal solution for the Traveling Sales Person problem
8. Print all the nodes reachable from a given starting node in a digraph using BFS method.
9. Check whether a given graph is connected or not using DFS method
10. Develop a program to implement All pair shortest path.
11. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm-
12. Find Minimum Cost Spanning Tree of a given undirected graph using Prim's algorithm-
13. Implement N Queen's problem using Back Tracking.

Comments

Post a Comment

Popular posts from this blog

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

   ISL   ENGINEERING   COLLEGE DEPARTMENT   OF   COMPUTER   SCIENCE   AND   ENGINEERING DESIGN   AND   ANALYSIS   OF   ALGORITHMS QUESTION   BANK                                         BE III Year II Semester (A & B Sections) –PC 603 CS     Academic   Year: 2020-21 SHORT   ANSWER   QUESTIONS   UNIT-I 1.        Why   is an algorithm analysis required? 2.        State   about   UNION &   FIND   operations. 3.        List   out   the   UNION   algorithm   using   weighting   rule. 4.        Given   f(n)=10n 2 +4n+3,   then   prove   that   f(n)=O(n 2 ). 5.  ...
Post a Comment
Read more

Cryptography and Network Security (CNS)

  CRYPTOGRAPHY AND NETWORK SECURITY (CNS) Unit I to V  Click Here Attacks on Computers and Computer Security SYLLABUS UNIT – I Security Concepts : Introduction, The need for security, Security approaches, Principles of security, Types of Security attacks, Security services, Security Mechanisms, A model for Network Security Cryptography Concepts and Techniques : Introduction, plain text and cipher text, substitution techniques, transposition techniques, encryption and decryption, symmetric and asymmetric key cryptography, steganography, key range and key size, possible types of attacks. UNIT – II Symmetric key Ciphers : Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block cipher operation, Stream ciphers, RC4. Asymmetric key Ciphers : Principles of public key cryptosystems, RSA algorithm, Elgamal Cryptography, Diffie-Hellman Key Exchange, Knapsack Algorithm. UNIT – III Cryptographic Hash Functions : Message Authentication, Secure Hash Algorithm (SHA- 512), Message auth...
Post a Comment
Read more

Introduction

  Welcome to Best Information for Learners and Job Seekers. Here you can find the best videos related to education and new technologies in the market as well as Govt. and Private Jobs. In this blog I am passing the information to users for user betterment to find the Education Material, Videos, Jobs and Others. Subscribe the You Tube Channel for E-learning Courses. PATHAN AHMED KHAN M.Tech.(Ph.D.)  Assistant Professor ISL Engineering College Mobile No: 0091-8019309323 email id: pathan.ahmed0504@gmail.com                 pathansknowledgehub@gmail.com
Post a Comment
Read more