MCA-201 Data Structure using C

[vc_row][vc_column width=”2/3″][vc_column_text]

MCA-201 Data Structure using C !

Introduction to Data Structures, Primitive and Composite, Arrays, Matrices, Sparse Matrices, Linear search, Binary search,Insertion sort, selection sort, Bubble Sort, String representation and manipulation, Complexity of Algorithms, Records and Pointers.

Linked lists: Searching, Insertion,Deletion,Sorted Linked List, circular list, header List, two-Way List; Stack, Queues ,Recurstion, Quick sort, Linked and Array representation of stacks, Queues and Dequeue,Polish notation , Priority Queues.

Trees: Binary trees, Threaded Binary tree, Balanced tree,Different tree traversal algorithms, Binary search tree, Huffman Tree, Heap Sort, AVL Search Trees, B Trees, m-way Search Trees.

Representation of Graphs and Applications:Adjacency matrix, path matrix, warshall’s Algorithm, Linked Representation of a graph, Traversing a Graph.

Sorting and searching: radix Sort, Merge Sort, Hashing.

[/vc_column_text][/vc_column][vc_column width=”1/3″][vc_wp_custommenu nav_menu=”160″][/vc_column][/vc_row]

Leave a Reply

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