DATA STRUCTURES USING C++ LAB

Paper Code:

MCA 226

Credits:

02

Periods/week:

04

Max. Marks:

100.00

Objective:

To develop skills to design and analyze simple linear and nonlinear data structures.
To strengthen the ability to identify and apply the suitable data structure for the given real world problem.
To gain knowledge in practical applications of data structures.

CONTENTS

Recursion:

a) Factorial numbers.

b) Fibonacci series.

Implementation of Stack Using Array, Implementation of Queue Using Array, Circular queue operations using Array.

Postfix-evaluation, Prefix-evaluation, Conversion of Infix to Postfix.

Single Linked list, Doubly Linked List, Implementation of Stack and Queue Using Linked List.

Binary Tree Traversal, Binary Search Tree.

Sorting Techniques: Bubble Sort, Selection Sort, Merge Sort, Quick Sort, Radix Sort, Heap Sort.

Searching Techniques: Linear Search, Binary Search

Implementation of minimum spanning trees.

Implementation of single source shortest path.

Implementation of the Floyd-Warshall algorithm for finding the shortest path between all nodes in a graph.

Academic Year: