{"id":15765,"date":"2026-03-20T06:35:50","date_gmt":"2026-03-20T06:35:50","guid":{"rendered":"https:\/\/bvcoend.ac.in\/?page_id=15765"},"modified":"2026-03-20T06:35:50","modified_gmt":"2026-03-20T06:35:50","slug":"data-structures-and-algorithms-lab","status":"publish","type":"page","link":"https:\/\/bvcoend.ac.in\/index.php\/data-structures-and-algorithms-lab\/","title":{"rendered":"DATA STRUCTURES AND ALGORITHMS LAB"},"content":{"rendered":"[vc_row][vc_column width=”1\/4″][vc_wp_custommenu title=”Imp Links” nav_menu=”73″][\/vc_column][vc_column width=”3\/4″][vc_column_text]\n

DATA STRUCTURES AND ALGORITHMS LAB<\/span><\/h3>\n

Introduction<\/span><\/h3>\n

The Data Structures and Algorithms (DSA) Laboratory provides students with practical experience in implementing fundamental data structures and analyzing algorithmic techniques used in efficient problem solving. In this lab, students learn to design and implement structures such as arrays, linked lists, stacks, queues, trees, and graphs, along with various searching and sorting algorithms. Programming exercises are carried out using languages such as C\/C++ or Python, enabling students to understand concepts like memory management, recursion, algorithm complexity, and optimization techniques. The laboratory helps students develop strong logical thinking, programming proficiency, and analytical skills, which are essential for solving real-world computational problems and for advanced studies in computer science and software development.<\/span><\/p>\n

Course Objectives<\/span><\/h3>\n\n\n\n\n\n\n
COB-1<\/strong><\/span><\/td>\nTo introduce basics of Data Structures (Arrays, strings, linked lists, etc.) and concepts of Stacks, Queues<\/span><\/td>\n<\/tr>\n
COB-2<\/strong><\/span><\/td>\nTo understand the concepts of Trees, heaps and related operations and their implementations<\/span><\/td>\n<\/tr>\n
COB-3<\/strong><\/span><\/td>\nTo introduce various Sorting and Searching Algorithms and Hashing<\/span><\/td>\n<\/tr>\n
COB-4<\/strong><\/span><\/td>\nTo understand sets and the concepts of Graphs and their applications<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Course Outcomes<\/span><\/h3>\n\n\n\n\n\n\n\n\n
CO<\/span><\/th>\nStatement<\/span><\/th>\nBloom\u2019s Level<\/span><\/th>\n<\/tr>\n<\/thead>\n
OCSE310T.1<\/strong><\/span><\/td>\nUnderstand data structures like Arrays, Stacks, Queues, Linked lists and ability to choose the efficient data structures for given problem<\/span><\/td>\nUnderstand, Remember, Evaluate<\/span><\/td>\n<\/tr>\n
OCSE310T.2<\/strong><\/span><\/td>\nConstruct Binary Search trees, Heap trees and AVL trees and learn about sparse matrix<\/span><\/td>\nCreate<\/span><\/td>\n<\/tr>\n
OCSE310T.3<\/strong><\/span><\/td>\nApply sorting and searching techniques efficiently and learn about Hashing and its types<\/span><\/td>\nApply<\/span><\/td>\n<\/tr>\n
OCSE310T.4<\/strong><\/span><\/td>\nApply graph theory and its concepts in various applications and analyse the graph traversal using DFS and BFS<\/span><\/td>\nApply, Analyse<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

CO-PO-PSO Mapping<\/span><\/h3>\n\n\n\n\n\n\n\n\n
CO\/PO<\/span><\/th>\nPO1<\/span><\/th>\nPO2<\/span><\/th>\nPO3<\/span><\/th>\nPO4<\/span><\/th>\nPO5<\/span><\/th>\nPO6<\/span><\/th>\nPO7<\/span><\/th>\nPO8<\/span><\/th>\nPO9<\/span><\/th>\nPO10<\/span><\/th>\nPO11<\/span><\/th>\nPO12<\/span><\/th>\nPSO1<\/span><\/th>\nPSO2<\/span><\/th>\n<\/tr>\n<\/thead>\n
OCSE310T.1<\/strong><\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n2<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n2<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n<\/tr>\n
OCSE310T.2<\/strong><\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n2<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n2<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n<\/tr>\n
OCSE310T.3<\/strong><\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n2<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n2<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n<\/tr>\n
OCSE310T.4<\/strong><\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n3<\/span><\/td>\n2<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n1<\/span><\/td>\n–<\/span><\/td>\n2<\/span><\/td>\n–<\/span><\/td>\n1<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\"\"Facilities<\/span><\/h3>\n

Operating System \/ Software<\/span><\/h4>\n\n\n\n\n\n\n
Sr. No.<\/span><\/th>\nName<\/span><\/th>\nVersion<\/span><\/th>\n<\/tr>\n<\/thead>\n
1.<\/span><\/td>\nWindows<\/span><\/td>\n10<\/span><\/td>\n<\/tr>\n
2.<\/span><\/td>\nVS CODE<\/span><\/td>\nOpen Source<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Hardware<\/span><\/h4>\n\n\n\n\n\n\n\n\n\n
Sr.No.<\/span><\/th>\nEquipment Name<\/span><\/th>\nSpecification<\/span><\/th>\nQuantity<\/span><\/th>\n<\/tr>\n<\/thead>\n
1.<\/span><\/td>\nComputer<\/span><\/td>\nIntel Core (i5), 5th gen, RAM-16GB<\/span><\/td>\n12<\/span><\/td>\n<\/tr>\n
2.<\/span><\/td>\nComputer<\/span><\/td>\nIntel Core (i5) 4th Generation 2.90GHz, RAM-16GB<\/span><\/td>\n1<\/span><\/td>\n<\/tr>\n
3.<\/span><\/td>\nComputer<\/span><\/td>\nIntel Core (i5), 7th gen, RAM-16GB<\/span><\/td>\n4<\/span><\/td>\n<\/tr>\n
4.<\/span><\/td>\nComputer<\/span><\/td>\nIntel Core (i5), 6th gen, RAM-16GB, 4GB<\/span><\/td>\n3<\/span><\/td>\n<\/tr>\n
5.<\/span><\/td>\nPrinter<\/span><\/td>\nHP Laser Jet Pro P1108 Plus<\/span><\/td>\n01<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Staff<\/span><\/h3>\n