# Data Structures and Algorithms Med Ele 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Open Elective II)

Data Structures and Algorithms Med Ele 7th Sem Syllabus for BE 2017 Regulation Anna Univ (Open Elective II) detail syllabus for Medical Electronics (Med Ele), 2017 regulation is collected from the Anna Univ official website and presented for students of Anna University. The details of the course are: course code (OCS751), Category (OE), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.

For all other med ele 7th sem syllabus for be 2017 regulation anna univ you can visit Med Ele 7th Sem syllabus for BE 2017 regulation Anna Univ Subjects. For all other Open Elective II subjects do refer to Open Elective II. The detail syllabus for data structures and algorithms is as follows.

#### Course Objective:

• To understand the various algorithm design and analysis techniques
• To learn linear data structures – lists, stacks, and queues
• To learn different sorting and searching algorithms
• To understand Tree and Graph data structures

#### Unit I

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

#### Unit II

Stacks and Queues

Stack ADT – Applications – Evaluating arithmetic expressions- Conversion of Infix to PostfixRecursion. Queue ADT – Priority Queue – applications of queues. Implementation of Stack ADT and palindrome checking using C. Implementation of Queue operations using arrays in C.

#### Unit III

Searching and Sorting Algorithms

Divide and conquer methodology – Searching: Linear Search – Binary Search. Sorting: Insertion sort – Merge sort – Quick sort – Heap sort. Analysis of searching and sorting techniques. Implementation of linear search, binary search, insertion sort, merge sort and quick sort algorithms in C.

#### Unit IV

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

#### Unit V

Graphs

Definition – Representation of Graph – Breadth-first traversal – Depth-first traversal – Dynamic programming Technique – Warshalls and Floyds algorithm – Greedy method – Dijkstras algorithm – applications of graphs. Implementation of graph, graph traversal methods, finding shortest path using Dijkstras algorithm in C

#### Course Outcome:

At the end of this course, the students should be able to:

• Implement linear data structures and solve problems using them.
• Implement and apply trees and graphs to solve problems.
• Implement the various searching and sorting algorithms.

#### Text Books:

1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education,1997.
2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2nd Edition, Pearson Education, 1988.

#### References:

1. Aho, Hopcroft and Ullman, Data Structures and Algorithms, Pearson Education,1983.
2. S.Sridhar, Design and Analysis of Algorithms, First Edition, Oxford University Press. 2014
3. Byron Gottfried, Jitender Chhabra, Programming with C (Schaums Outlines Series), Mcgraw Hill Higher Ed., III Edition, 2010
4. Yashvant Kanetkar, Data Structures Through C, BPB publications, II edition, 2003

For detail syllabus of all other subjects of BE Med Ele, 2017 regulation do visit Med Ele 7th Sem syllabus for 2017 Regulation.

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