OCS751 Data Structures and Algorithms Syllabus Notes Question Banks with answers

OCS751 Data Structures and Algorithms Syllabus Notes Question Paper Question Banks with answers Anna University

Anna University Data Structures and Algorithms Syllabus Notes Question Bank Question Papers Regulation 2017

Anna University OCS751 Data Structures and Algorithms Notes are provided below. OCS751 Notes all 5 units notes are uploaded here. here OCS751 Data Structures and Algorithms notes download link is provided and students can download the OCS751 DSA Lecture Notes and can make use of it.

OCS751 Data Structures and Algorithms Syllabus Regulation 2017

UNIT I ALGORITHM ANALYSIS, LIST ADT

Algorithms: Notation - analysis – running time calculations. Abstract Data Types (ADTs): List ADT – array-based implementation – linked list implementation – singly linked lists- applications of lists: Polynomial Manipulation. Implementation of List ADT using an array and using a linked list in C.

UNIT II STACKS AND QUEUES

Stack ADT - Applications - Evaluating arithmetic expressions- Conversion of Infix to Postfix- Recursion. 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 TREES

Tree ADT – tree traversals - Binary Tree ADT – expression trees – binary search tree ADT – applications of trees. Heap – applications of heap. Implementation of Binary search tree and its operations, tree traversal methods, finding height of the tree using C. Implementation of heap and heap sorting using arrays in C.

UNIT V GRAPHS

Definition – Representation of Graph – Breadth-first traversal - Depth-first traversal – Dynamic programming Technique – Warshall’s and Floyd’s algorithm – Greedy method - Dijkstra’s algorithm – applications of graphs. Implementation of graph, graph traversal methods, finding shortest path using Dijkstra’s algorithm in C

Click below link to download Data Structures and Algorithms Syllabus Notes Question papers Question Banks 2 marks with answers Part B Questions with answers download.
OCS751 Notes 1 link download - Click here
OCS751 Question Bank download - click here
OCS751 Two Marks with Answers download - click here*
If you have any problem in downloading the above material, you can comment below.
Other useful links:
Anna University internal Marks Out of 20 check here
Anna University Notes download for all Department - Click here to download
Anna University Previous year Question Paper Collections - Click Here
Check Anna University results updates
UG Syllabus regulation 2017 - Click here
PG Syllabus regulation 2017 - Click here
Anna University Result date - Click here to check
Anna University Timetable April May 2021 download here

Search by students
OCS751 Data Structures and Algorithms Regulation 2017 notes
Anna university UG Notes
Anna University Regulation 2017 Notes Syllabus
Regulation 2017 Syllabus Notes Anna University
OCS751 Data Structures and Algorithms Notes Syllabus
OCS751 Data Structures and Algorithms Notes
OCS751 Data Structures and Algorithms Syllabus
OCS751 Data Structures and Algorithms Question papers
OCS751 Data Structures and Algorithms Question Bank