Showing posts with label ADA SYLLABUS. Show all posts
Showing posts with label ADA SYLLABUS. Show all posts
META TAGS:- RGPV IT 4TH SEM SYLLABUS I RGTU IT 4TH SEMESTER SYLLABUS I DOWNLOAD RGPV 4TH SEM SYLLABUS I RGPV IT 4TH SEM CSO SYLLABUS I RGPV IT 4TH SEM SYLLABUS IN PDF I RGPV IT 4TH SEM ADC SYLLABUS IT 4TH SEM DBMS SYLLABUS I RGPV IT 4TH SEM ADA SYLLABUS I IT 4TH SEM DISCRETE STRUCTURE SYLLABUS I RGPV IT 4TH SEM COMPLETE SYLLABUS I RGPV IT ALL SEMESTER SYLLABUS I RGPV ALL SEM SYLLABUS I RGTU IT 4TH SEMESTER SYLLABUS
Rajiv Gandhi Proudyogiki Vishwavidyalaya
PROGRAMME: B.E. Information Technology, IV SemesterTAGS:-RGPV ADA SYLLABUS I RGPV CS 4TH SEM ADA SYLLABUS I ANALYSIS DESIGN AND ALGORITHM SYLLABUS I RGPV CSE CS404 SYLLABUS I RGTU SYLLABUS I RGPV COMPUTER SCIENCE ENGINEERING 4TH SEM SYLLABUS I RGPV BHOPAL SYLLABUS I RGPV PAPERS I RGPV ADA PAPER I RGPV ADA PREVIOUS YEAR PAPERS I ADA SYLLABUS
B.E. Computer Science Engg.
Semester :-IV
Subject :- Analysis Design and Algorithum
Revised Syllabus and Scheme of Examination
Effective from July 2010
ANALYSIS DESIGN AND ALGORITHMS(CS-404)
Unit I
Algorithms: Designing algorithms, analyzing algorithms, asymptotic notations, heap and heapsort. Introduction to divide and conquer technique, analysis, design and comparison of variousalgorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.
Unit II
Study of Greedy strategy: examples of greedy method like optimal merge patterns, Huffman coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path algorithm, etc.
Unit III
Concept of dynamic programming: problems based on this approach such as 0/1 knapsack,multistage graph, reliability design, Floyd-Warshall algorithm, etc.
Unit IV
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph
coloring problem etc. Introduction to branch & bound method, examples of branch and bound method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.
Unit V
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.
