4th Sem, CE

BTCOC401: Design & Analysis of Algorithms Syllabus for CE 4th Sem 2018-19 DBATU

Design & Analysis of Algorithms detailed syllabus scheme for B.Tech Computer Engineering (CE), 2018-19 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.

For all other DBATU Syllabus for Computer Engineering 4th Sem 2018-19, do visit CE 4th Sem 2018-19 Onwards Scheme. The detailed syllabus scheme for design & analysis of algorithms is as follows.

Design & Analysis of Algorithms Syllabus for Computer Engineering (CE) 2nd Year 4th Sem 2018-19 DBATU

Design & Analysis of Algorithms

Unit 1

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Unit 2

Divide and Conquer: Introduction to Divide and Conquer Technique, Binary Search, Merge Sort, Quick Sort, Strassens Matrix Multiplication.

Unit 3

Greedy Algorithms: Introduction to Greedy Technique, Greedy Method, Optimal Merge Patterns, Huffman Coding, Knapsack Problem, Activity Selection Problem, Job Sequencing with Deadline, Minimum Spanning Tree, Single-Source Shortest Path Algorithm.

Unit 4

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Unit 5

Backtracking: Backtracking Concept, N-Queens Problem, Four-Queens Problem, Eight-Queen Problem, Hamiltonian Cycle, Sum of Subsets Problem, Graph Coloring Problem. Branch and Bound: Introduction, Traveling Salesperson Problem, 15-Puzzle Problem, Comparisons between Backtracking and Branch and Bound.

Unit 6

Tree: Introduction, B-tree, Red-Black Tree (RBT): Insertion, Deletion. NP Completeness: Introduction, The Complexity Class P, The Complexity Class NP, PolynomialTime Reduction, The Complexity Class NP-Complete.

Reference Books:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
Get it on Google Play.

Text Books:

  1. Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition, 2002.
  2. Ellise Horowitz, Sartaj Sahni, S. Rajasekaran, Fundamentals of Computer Algorithms, University Press (India) Private Ltd, 2nd Edition, 2008.
  3. Sara Base, Computer algorithms: Introduction to Design and Analysis, Addison-Wesley Publication, 2nd Edition, 1988.

For detail syllabus of all other subjects of Computer Engineering (CE) 4th Sem 2018-19 regulation, visit CE 4th Sem Subjects syllabus for 2018-19 regulation.

Leave a Reply

Your email address will not be published. Required fields are marked *

*