DATA STRUCTURES USING C++ LAB

Paper Code: 
MCA 226
Credits: 
02
Periods/week: 
4
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.

 

 

Unit I: 
  1. Recursion:

         a) Factorial numbers.

         b) Fibonacci series.

  1. Implementation of Stack Using Array, Implementation of Queue Using Array, Circular queue operations using Array.
  1. Postfix-evaluation, Prefix-evaluation, Conversion of Infix to Postfix.
  1. Single Linked list, Doubly Linked List, Implementation of Stack and Queue Using Linked List.
  1. Binary Tree Traversal, Binary Search Tree.
  1. Sorting Techniques: Bubble Sort, Selection Sort, Merge Sort, Quick Sort, Radix Sort, Heap Sort.
  1. Searching Techniques: Linear Search, Binary Search
  1. Implementation of minimum spanning trees.
  1. Implementation of single source shortest path.
  1. Implementation of the Floyd-Warshall algorithm for finding the shortest path between all nodes in a graph.

 

Academic Year: 
2016-17
  • Printer-friendly version