Scribd
Upload
47 views

AdA Syllabus

The document outlines the syllabus for the Algorithms Design and Analysis course (CY603PC) for B.Tech. CSE (Cyber Security) at JNTU Hyderabad. It covers algorithm performance analysis, major algorithmic techniques, and the classification of problems such as P, NP, and NP-complete. The course includes various units focusing on different algorithmic methods, applications, and traversal techniques, along with recommended textbooks and references.

Uploaded by

Kore Ramesh
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
47 views

AdA Syllabus

The document outlines the syllabus for the Algorithms Design and Analysis course (CY603PC) for B.Tech. CSE (Cyber Security) at JNTU Hyderabad. It covers algorithm performance analysis, major algorithmic techniques, and the classification of problems such as P, NP, and NP-complete. The course includes various units focusing on different algorithmic methods, applications, and traversal techniques, along with recommended textbooks and references.

Uploaded by

Kore Ramesh
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/ 1

R22 B.Tech.

CSE (Cyber Security) Syllabus JNTU Hyderabad

CY603PC: ALGORITHMS DESIGN AND ANALYSIS

B.Tech. III Year II Sem. L T P C


3 0 0 3
Prerequisites: Programming for problem solving and Data Structures
Course Objectives:
 Introduces the notations for analysis of the performance of algorithms.
 Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic
programming, greedy, branch and bound methods) and mention problems for which each
technique is appropriate;
 Describes how to evaluate and compare different algorithms using worst, average, and best-
case analysis.
 Explains the difference between tractable and intractable problems, and introduces the
problems that are P, NP and NP complete.

Course Outcomes:
 Analyze the performance of algorithms
 Choose appropriate data structures and algorithm design methods for a specified application
 Understand the choice of data structures and the algorithm design methods

UNIT - I
Introduction: Algorithm, Performance Analysis-Space complexity, Time complexity, Asymptotic
Notations- Big oh notation, Omega notation, Theta notation and Little oh notation.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s
matrix multiplication.

UNIT - II
Disjoint Sets: Disjoint set operations, union and find algorithms, Priority Queue- Heaps, Heapsort
Backtracking: General method, applications, n-queen’s problem, sum of subsets problem, graph
Coloring, Hamiltonian cycles.

UNIT - III
Dynamic Programming: General method, applications- Optimal binary search tree, 0/1 knapsack
problem, All pairs shortest path problem, Traveling sales person problem, Reliability design.

UNIT - IV
Greedy method: General method, applications- Job sequencing with deadlines, knapsack problem,
Minimum cost spanning trees, Single source shortest path problem.
Basic Traversal and Search Techniques: Techniques for Binary Trees, Techniques for Graphs,
Connected components, Biconnected components.

UNIT - V
Branch and Bound: General method, applications - Travelling sales person problem, 0/1 knapsack
problem - LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard and
NP-Complete classes, Cook’s theorem.

TEXT BOOK:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan,
University Press.

REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C.
Stein, PHI Pvt. Ltd./ Pearson Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T. Goodrich and
R.Tamassia, John Wiley and sons.

Page 95 of 150

You might also like