DATA STRUCTURES USING C++ (PRACTICAL)
DATA STRUCTURES USING C++ (PRACTICAL)
Program Details
Name of the Program Bachelor of Computer Applications (BCA) Program Code 3
Course Details
Group Name COMPUTER APPLICATION
Course Name DATA STRUCTURES USING C++ (PRACTICAL)
Course Code BCAP210 Total Duration 60
Course Type Major Credit 2
Max. Marks 100 (Internal: 40 + External: 60)
Course Applicable To BCA
Course Summary
This course provides a comprehensive programming implementation of data structures and algorithms, focusing on
their design, implementation, and applications.
Covers basic concepts of algorithms and data structures, including linear and non-linear structures. It introduces
singly linked lists, circularly linked lists, and doubly linked lists, along with their operations. It also discusses the
representation and operations (insert, delete, update) of single and two-dimensional arrays. Also the use of Recursive
Functions
Focuses on implementation of stacks and queues. It deals with program on stack operations, array and linked
implementations, and applications like infix-to-postfix conversion and recursion. For queues, it covers insertion,
deletion, array and linked implementations, circular queues, dequeue (double-ended queue), and priority queues.
Representation of trees and their operations, It focuses on binary trees, their array and linked representations, and
traversals (preorder, inorder, postorder).
Explores graphs, including their types, representations, and traversals (Depth-First Search and Breadth-First Search).
Discusses sorting and searching methods. It covers sorting algorithms like bubble sort, insertion sort, quick sort, and
selection sort, along with string sorting and comparisons. For searching, it implements linear search, binary search
Course Outcomes
Code Details
To Demonstrate the use of basic Data Structures. and to demonstrate operations on Linked Lists and
CO1
Arrays.
CO2 To Construct Stack and Queue using Array and Linked List. to evaluate Infix and Postfix Expressions
CO3 To Construct different Trees and Perform different tree traversals.
CO4 To Construct Graphs and Perform graph traversals.
CO5 To Implement different Sorting and Searching methods.
Syllabus
Suggested List of Practicals