15CS53T: Design and Analysis of Algorithms Computers 5th Sem Syllabus for Diploma DTE Karnataka C15 Scheme

Design and Analysis of Algorithms detail DTE Kar Diploma syllabus for Computer Science And Engineering (CS), C15 scheme is extracted from DTE Karnataka official website and presented for diploma students. The course code (15CS53T), and for exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.

For all other computers 5th sem syllabus for diploma c15 scheme dte karnataka you can visit Computers 5th Sem Syllabus for Diploma C15 Scheme DTE Karnataka Subjects. The detail syllabus for design and analysis of algorithms is as follows.

Pre-requisites:

Knowledge of Data Structures.

Course Objectives:

Study the concepts of fundamentals of algorithm, Analysis of algorithm efficiency, Brute force techniques, Divide-and-Conquer, Decrease-and-Conquer, Greedy techniques.

Course Outcomes:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT I: Introduction 10 Hrs

What is an Algorithm? Fundamentals of Algorithmic problem solving, Important problem types. Fundamental data structures

UNIT II: Fundamentals of the Analysis of Algorithm Efficiency 10Hrs

Analysis Framework, Measuring the input size, Units for measuring Running time, Orders of Growth, Worst-case, Best-case and Average-case efficiencies, Asymptotic Notations and Basic Efficiency classes, Informal Introduction, O-notation, Q-notation, 9-notation, mathematical analysis of non-recursive algorithms, mathematical analysis of recursive algorithms.

UNIT III: Brute Force & Exhaustive Search 12Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

UNIT IV: Divide-and-Conquer 08 Hrs

Introduction, Merge Sort, Quick Sort, Binary Search, Binary Tree traversals and related properties.

UNIT V: Decrease-and-Conquer 06 Hrs

Decrease-and-Conquer:
Introduction, Insertion Sort, Topological Sorting.

UNIT VI: Greedy Technique 06 Hrs

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Text Books:

1. Introduction to the Design and Analysis of Algorithms, 3rd edition, Anany Levitin, Pearson Publication, ISBN: 9789332583771

Reference Books:

1. http://nptel.ac.in/courses/106101060/
2. http://www.tutorialspoint.com/data_structures_algorithms/
3. Design & Analysis of Algorithms, S. Nandagopalan, Sapna Book House.

Suggested List of Student Activities:

Note: the following activities or similar activities for assessing CIE (IA) for 5 marks (Any one)

Student activity like mini-project, surveys, quizzes, etc.

1. Each individual student should do any one of the following type activity or any other similar activity related to the course and before conduction, get it approved from concerned course coordinator and programme coordinator.
2. Each student should conduct different activity and no repeating should occur

1. Build and execute programs from the unsolved exercises given from the course textbook at the end of each chapters.
2. Quiz

Course Delivery:

The course will be delivered through lectures and Power point presentations/ Video

Model Question Paper:

(CIE)

1. Explain Euclid’s algorithm for computing GCD of two numbers.(5)

OR Explain Linear data structures with example. (5)

2. Write an algorithm for sequential search and analyse its worst-case, best-case and average-case efficiencies. (5)

OR Write a recursive algorithm for computing the factorial function for an arbitrary non-negative integer.(5)

3. Apply selection sort to the following array 45,23,89,10,11,27,38 (5)
4. Differentiate undirected and directed graphs with examples. (5)

Model Question Paper:

PART-A

Answer any SIX questions. Each carries 5 marks. 5X6=30 Marks

1. Explain Euclid’s algorithm for computing GCD of two numbers.
2. Differentiate undirected and directed graphs with examples.
3. Write a pseudo code for finding the value of the largest element in a list of n numbers.
4. Write a recursive algorithm for computing the factorial function for an arbitrary nonnegative integer.
5. Define Brute force and explain it with example.
6. Define binary tree. Explain its traversals.
7. Derive an expression for worst case analysis of binary search algorithm
8. Apply Prim’s algorithm for the graph shown below
9. Write Greedy algorithm and explain

PART-B

Answer any SEVEN questions. Each carries 10 marks. 7X10=70 Marks

1. Explain the steps involved in designing and analysing an algorithm.
2. Write a note on Sorting and Searching problem types.
3. Write an algorithm for sequential search and analyse its worst-case, best-case and average-case efficiencies.
4. Apply selection sort to the following array : 45,23,89,10,11,27,38
5. Explain bubble sort method with an example. Use Brute Force approach.
6. Solve using DFS algorithm
7. Write an algorithm of Quick Sort and trace it for an example data set.
8. Compute time complexity of insertion sort in the best, worst and average cases.
9. Write the Kruskal’s algorithm to find the minimum cost spanning tree.

For detail syllabus of all other subjects of BE Computers, C15 scheme do visit Computers 5th Sem syllabus for C15 scheme.

Dont forget to download iStudy Syllabus App for latest syllabus and results, class timetable and more.